- 博客(5)
- 资源 (15)
- 收藏
- 关注
RSS订阅原创 京东2015 笔试 编程题
int dp(int[] a, int n, int m){ int[][] s = new int[n][m + 1]; for(int i = 0; i < n; i++) for(int j = 1; j <= m; j++) if(i == 0) s[i][j] = a[i] == j ? a[i] : -1; else if(j < 10) s[i]
2014-10-13 10:37:55
1093
1
原创 LeetCode-Maximum Product Subarray
作者：disappearedgod文章出处：http://blog.csdn.net/disappearedgod/article/details/39642807时间：2014-9-28
2014-10-06 22:48:24
1019
原创 LeetCode-Substring with Concatenation of All Words
作者：disappearedgod文章出处：http://blog.csdn.net/disappearedgod/article/details/39775777时间：2014-10-4题目解法代码结果返回LeetCode Solution(持续更新，java>c++)
2014-10-04 17:41:38
838
原创 LeetCode-Letter Combinations of a Phone Number
作者：disappearedgod文章出处：http://blog.csdn.net/disappearedgod/article/details/39757403时间：2014-10-3题目代码解法结果返回
2014-10-04 04:57:49
1152
原创 LeetCode-Subsets
作者：disappearedgod文章出处：http://blog.csdn.net/disappearedgod/article/details/39642807时间：2014-9-28题目Permutations Total Accepted: 25153 Total Submissions: 80140My Submissions
2014-10-03 18:56:40
870
2010-PhysicalReport-Community detection in graphs
2013-05-07
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人