2015 年 3月 5 日随笔档案 - neverlandly

2015年3月5日

摘要： Given n unique integers, number k (1> kSumII(int A[], int k, int target) { 9 // write your code here10 ArrayList> res = new ArrayList>... 阅读全文

posted @ 2015-03-05 06:51 neverlandly 阅读(1209) 评论(0) 推荐(0)

Lintcode: Interleaving Positive and Negative Numbers

摘要： Given an array with positive and negative integers. Re-range it to interleaving with positive and negative integers.NoteYou are not necessary to keep ... 阅读全文

posted @ 2015-03-05 06:14 neverlandly 阅读(1096) 评论(0) 推荐(1)

Lintcode: Insert Node in a Binary Search Tree

摘要： Given a binary search tree and a new tree node, insert the node into the tree. You should keep the tree still be a valid binary search tree.ExampleGi... 阅读全文

posted @ 2015-03-05 05:00 neverlandly 阅读(1265) 评论(0) 推荐(0)