Same Tree
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 n...
分类：
其他好文 时间：
2014-06-19 12:49:17
阅读次数：
301
Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe...
分类：
其他好文 时间：
2014-06-19 11:23:05
阅读次数：
204
Currency Exchange
Time Limit: 1000MS
Memory Limit: 30000K
Total Submissions: 18899
Accepted: 6743
Description
Several currency exchange points are working in our city...
分类：
其他好文 时间：
2014-06-16 11:44:36
阅读次数：
208
There are two places that SSL will need to be configured if SSL is to be used between the controller and the Open vSwtich. The instructions below assu...
分类：
其他好文 时间：
2014-06-15 21:59:43
阅读次数：
337
原题地址：https://oj.leetcode.com/problems/merge-two-sorted-lists/题意：Merge two sorted linked lists and return it as a new list. The new list should be made...
分类：
编程语言 时间：
2014-06-15 21:58:31
阅读次数：
238
题目
The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, ...
1 is read off as "one
1" or 11.
11 is read off as "two
1s" or 21.
21 i...
分类：
其他好文 时间：
2014-06-15 18:51:33
阅读次数：
220
http://acm.hdu.edu.cn/game/entry/problem/list.php?chapterid=1§ionid=21.2.5
#include
/*
题意：找闰年。
if((i%4==0 && i%100!=0) || i%400==0)count++;
3
2005 25
1855 12
2004 10000
2108
1904
43236
*/
int ma...
分类：
其他好文 时间：
2014-06-14 06:32:08
阅读次数：
320
题目
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.
方法
将num1与0-9相乘的结果存...
分类：
其他好文 时间：
2014-06-14 06:08:30
阅读次数：
229
Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10239 Accepted Submission(s): 4656
Problem Description
Given two se...
分类：
其他好文 时间：
2014-06-14 00:22:38
阅读次数：
243
Swap Nodes in Pairs：Given a linked list, swap every
two adjacent nodes and return its head.For example,Given1->2->3->4, you
should return the list as2...
分类：
其他好文 时间：
2014-06-13 17:04:27
阅读次数：
180
