#include#include#includechar *g_WordTable[10]= {"zero", "one", "two", "three", "four", "five","six", "seven", "eight", "nine"};int main(){ //存放用户输入...
分类：
其他好文 时间：
2014-08-02 12:31:53
阅读次数：
530
Suppose we have a framefinal JFrame jframe = new JFrame("Triangle 3");To catch window closing events and quit, there are two ways (as I know):Way1.jfr...
Edit DistanceGiven two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You...
分类：
其他好文 时间：
2014-08-02 01:29:22
阅读次数：
309
In this challenge you need to print the data that accompanies each integer in a list. In addition, if two strings have the same integers, you need to ...
分类：
其他好文 时间：
2014-08-01 22:40:42
阅读次数：
323
Problem Description:
Given two numbers represented as strings, return multiplication of the numbers as a string.
Note: The numbers can be arbitrarily large and are non-negative.
分析：两个string相乘...
分类：
其他好文 时间：
2014-08-01 16:06:01
阅读次数：
141
问题描述：
Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
解题思路：...
分类：
其他好文 时间：
2014-08-01 13:48:11
阅读次数：
183
Mobile phoneshttp://poj.org/problem?id=1195 1 #include 2 #include 3 #define mt(a,b) memset(a,b,sizeof(a)) 4 const int M=1030; 5 class Two_Tree_Array {...
分类：
其他好文 时间：
2014-08-01 13:03:01
阅读次数：
168
题目还原
Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up t...
分类：
其他好文 时间：
2014-08-01 02:25:11
阅读次数：
391
本文为senlie原创，转载请保留此地址：http://blog.csdn.net/zhengsenlieSwap Nodes in PairsTotal Accepted:12511Total Submissions:39302Given a linked list, swap every two...
分类：
其他好文 时间：
2014-07-31 23:26:40
阅读次数：
307
Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally ide...
分类：
其他好文 时间：
2014-07-31 23:15:00
阅读次数：
201
