摘要：
Just corner case..class Solution {public: ListNode *reverseBetween(ListNode *head, int m, int n) { if(m == n) return head; ListNode *... 阅读全文
posted @ 2014-07-31 08:06
Tonix
阅读(126)
评论(0)
推荐(0)
摘要：
I fell in a deadloop, and didn't see the actual recursion pattern.Reference:http://fisherlei.blogspot.com/2013/03/leetcode-unique-binary-search-trees-... 阅读全文
posted @ 2014-07-31 07:19
Tonix
阅读(98)
评论(0)
推荐(0)
摘要：
The only difference with version I is: one number can only be used once:class Solution {public: vector > ret; struct Rec { Rec() : sum... 阅读全文
posted @ 2014-07-31 03:40
Tonix
阅读(108)
评论(0)
推荐(0)
浙公网安备 33010602011771号