随笔分类 - 动态规划

leetcode300_最长上升子序列

摘要：public int lengthOfLIS(int[] nums) { int len = nums.length, ans = 1; int[] dp = new int[len]; dp[0] = 1; for(int i = 1; i < len; i++) { dp[i] = 1; for 阅读全文

posted @ 2022-02-24 22:35 明卿册阅读(13) 评论(0) 推荐(0) 编辑

leetcode152_乘积最大子数组

摘要：public int maxProduct(int[] nums) { int len = nums.length, ans = nums[0]; int[] dpMax = new int[len], dpMin = new int[len]; dpMax[0] = nums[0]; dpMin[ 阅读全文

posted @ 2022-02-24 22:19 明卿册阅读(14) 评论(0) 推荐(0) 编辑

leetcode322_零钱兑换

摘要：class Solution { public int coinChange(int[] coins, int amount) { int[] dp = new int[amount+1]; for(int i = 0; i < dp.length; i++) dp[i] = amount+1; / 阅读全文

posted @ 2022-02-12 22:30 明卿册阅读(18) 评论(0) 推荐(0) 编辑

leetcode53_最长子序列和

摘要：public int maxSubArray(int[] nums) { int len = nums.length,ans = nums[0]; int[] dp = new int[len]; dp[0] = nums[0]; for(int i = 1; i < len; i++) { dp[ 阅读全文

posted @ 2022-02-04 22:06 明卿册阅读(17) 评论(0) 推荐(0) 编辑

leetcode 37 数独

摘要：private boolean[][] r = new boolean[9][9]; private boolean[][] c = new boolean[9][9]; private boolean[][][] x = new boolean[3][3][9]; private boolean 阅读全文

posted @ 2022-01-29 22:52 明卿册阅读(27) 评论(0) 推荐(0) 编辑