![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
三岁就很萌@D
这个作者很懒,什么都没留下…
展开
-
LeetCode - 152 乘积最大子数组
无原创 2022-07-04 10:03:35 · 110 阅读 · 0 评论 -
Leetcode53-最大子序和
无原创 2019-11-17 19:04:58 · 84 阅读 · 0 评论 -
LeetCode - 673. 最长递增子序列的个数
无原创 2022-07-02 22:18:49 · 100 阅读 · 0 评论 -
Leetcode 300 最长递增子序列
int lengthOfLIS(int* nums, int numsSize){ int count[10000]={0}; int i=0,j=0; count[0]=1; int max=0; int c=0; for(i=1;i<numsSize;i++){ count[i]=1; for(j=0;j<i;j++){ if(nums[j]<nums[i]){ c=1+cou.原创 2022-07-01 11:17:48 · 80 阅读 · 0 评论 -
LeetCode - 5 最长回文子串
无原创 2022-06-25 14:10:32 · 108 阅读 · 0 评论 -
LeetCode-42 接雨水
class Solution { //动态规划 public int trap(int[] height) { int length = height.length; if(length==0) return 0; int[] leftMax = new int[length]; int[] rightMax = new int[length]; leftMax[0] = height[0.原创 2021-11-28 12:19:27 · 69 阅读 · 0 评论 -
LeetCode-322 零钱兑换
class Solution { public int coinChange(int[] coins, int amount) { int length = coins.length; int[] dp = new int[amount + 1]; int max = amount + 1; Arrays.fill(dp,max); dp[0] = 0; for(int i = 1;i <= am.原创 2021-11-16 13:13:24 · 239 阅读 · 0 评论 -
LeetCode-343 整数拆分
class Solution { public int integerBreak(int n) { int[] dp = new int [n+1]; int[] val = new int [n+1]; dp[1] = 1; val[1] = 1; for(int i = 2;i <= n;i++) { int mid = i/2; for(int.原创 2021-11-16 12:51:35 · 75 阅读 · 0 评论 -
LeetCode-279 完全平方数
class Solution { public int numSquares(int n) { int[] f = new int[n + 1]; for (int i = 1; i <= n; i++) { int minn = Integer.MAX_VALUE; for (int j = 1; j * j <= i; j++) { minn = Math.min(mi..原创 2021-11-13 10:45:46 · 199 阅读 · 0 评论