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

摘要： Given n distinct positive integers, integer k (k i) res[i][j][t] = 0;18 else res[i][j][t] = res[i-1][j][t];19 ... 阅读全文

posted @ 2015-03-07 05:22 neverlandly 阅读(543) 评论(0) 推荐(0)

摘要：类似BackpackII问题 1 static int maximize_loot(int[] gold, int[] silver) { 2 int[][] res = new int[gold.length+silver.length+1][10001]; 3 ... 阅读全文

posted @ 2015-03-07 03:50 neverlandly 阅读(314) 评论(0) 推荐(0)

摘要： 1 static LinkedListNode removeDuplicates(LinkedListNode list) { 2 LinkedListNode cur = list; 3 HashSet set = new HashSet(); 4 ... 阅读全文

posted @ 2015-03-07 03:37 neverlandly 阅读(292) 评论(0) 推荐(0)

摘要： 1 static int CoinTossEndAmount(int betAmount, String coinTossResults) { 2 if (betAmount <=0 || coinTossResults.length() == 0) return betA... 阅读全文

posted @ 2015-03-07 03:33 neverlandly 阅读(309) 评论(0) 推荐(0)