- 博客(3)
- 资源 (3)
- 收藏
- 关注
转载 Leetcode 329, Longest Increasing Path in a Matrix
Native的DFS,TLE:public int longestIncreasingPath(int[][] matrix) { if(matrix==null||matrix.length==0||matrix[0].length==0) return 0; int[] max = new int[1];
2017-01-18 11:41:36 207
转载 Leetcode 322, Coin Change
public int coinChange(int[] coins, int amount) { int[] dp = new int[amount + 1];//12 Arrays.fill(dp, Integer.MAX_VALUE); dp[0] = 0; for (int i = 1; i <= amoun
2017-01-17 13:48:46 204
转载 Leetcode 282, Expression Add Operators
public List addOperators(String num, int target) { List res = new ArrayList(); helper(res, "", target, num, 0, 0); return res; } private void helper(List res, Stri
2017-01-13 12:51:28 201
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人