Reverse TextTime Limit: 2 Seconds Memory Limit: 65536 KBIn most languages, text is written from left to right. However, there are other languages whe....
分类：
其他好文 时间：
2014-08-01 19:23:32
阅读次数：
202
function save(){ var nodes = $('#funcSelectTree').tree('getChecked');//获取所有打勾的节点 var flag = false; var array = new Ar...
分类：
其他好文 时间：
2014-08-01 18:30:12
阅读次数：
227
问题描述：
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
Given a linked list and a value x, partition it such that all nodes less than
x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of ...
分类：
其他好文 时间：
2014-08-01 13:45:32
阅读次数：
163
Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi...
分类：
其他好文 时间：
2014-08-01 04:40:11
阅读次数：
166
Description:Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Clarification:What...
分类：
其他好文 时间：
2014-08-01 04:38:31
阅读次数：
183
本文为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
Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root ...
分类：
其他好文 时间：
2014-07-31 23:19:10
阅读次数：
259
Problem Description:
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbe...
分类：
其他好文 时间：
2014-07-31 20:47:17
阅读次数：
215
Just corner case..class Solution {public: ListNode *reverseBetween(ListNode *head, int m, int n) { if(m == n) return head; ListNode *...
分类：
其他好文 时间：
2014-07-31 09:34:05
阅读次数：
245
