From 4b212acc8dce5537c4a801e8fd0a723d2d7195c5 Mon Sep 17 00:00:00 2001 From: Mprotecter <827289858@qq.com> Date: Thu, 14 May 2020 23:46:57 +0800 Subject: [PATCH 1/6] =?UTF-8?q?1024=5F=E5=88=B7=E4=B8=80=E5=8D=8A?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 70c9916..c264b6a 100644 --- a/README.md +++ b/README.md @@ -60,8 +60,8 @@ | | 唐轩 | 李昱 | 杨磊 | 宋声林 | 唐斌 | 黄俊龙 | | :--: | :-----------------------: | :-----------------------------: | :--: | :----: | :--: | :----: | | 5.12 | 206.链表反转 （三种解法） | 523. 连续的子数组和 | | | | | -| 5.13 | 3.无重复字符的最长字串 | 1277. 统计全为 1 的正方形子矩阵 | | | | | -| 5.14 | | | | | | | +| 5.13 | 3.无重复字符的最长字串 | 1277. 统计全为 1 的正方形子矩阵 | | | | | +| 5.14 | | 1024. 视频拼接（待完成） | | | | | | 5.15 | | | | | | | | 5.16 | | | | | | | | 5.17 | | | | | | | From 225e2287b188830d21c078e1a7eab54b98fdb1c8 Mon Sep 17 00:00:00 2001 From: Mprotecter <827289858@qq.com> Date: Fri, 15 May 2020 22:31:16 +0800 Subject: [PATCH 2/6] liyu_0515_121 --- ...60\345\215\226\350\202\241\347\245\250.md" | 37 +++++++++++++++++++ README.md | 2 +- 2 files changed, 38 insertions(+), 1 deletion(-) create mode 100644 "LiYu/121.\344\271\260\345\215\226\350\202\241\347\245\250.md" diff --git "a/LiYu/121.\344\271\260\345\215\226\350\202\241\347\245\250.md" "b/LiYu/121.\344\271\260\345\215\226\350\202\241\347\245\250.md" new file mode 100644 index 0000000..457dce1 --- /dev/null +++ "b/LiYu/121.\344\271\260\345\215\226\350\202\241\347\245\250.md" @@ -0,0 +1,37 @@ +121.买卖股票 + +解法1 枚举。。 + +class Solution { + + public int maxProfit(int[] prices) { + + + +​ if(prices.length == 0){ + +​ return 0; + +​ } + +​ int max = 0; //只要知道最高利润和最低股价 + +​ int lowPrice = prices[0]; + +​ for(int i = 1; i < prices.length ; i++){ + +​ max = Math.max(prices[i]-lowPrice,max); 每次判断一下金额是否最高，股价是否最低。 + +​ lowPrice = Math.min(lowPrice,prices[i]); + +​ } + +​ return max; + + } + +} + +动态规划 + +周六补充（） \ No newline at end of file diff --git a/README.md b/README.md index c264b6a..50a8749 100644 --- a/README.md +++ b/README.md @@ -62,7 +62,7 @@ | 5.12 | 206.链表反转 （三种解法） | 523. 连续的子数组和 | | | | | | 5.13 | 3.无重复字符的最长字串 | 1277. 统计全为 1 的正方形子矩阵 | | | | | | 5.14 | | 1024. 视频拼接（待完成） | | | | | -| 5.15 | | | | | | | +| 5.15 | | 121.买卖股票 | | | | | | 5.16 | | | | | | | | 5.17 | | | | | | | | 5.18 | | | | | | | From 6e1f9c62f0afc2ed931a09dd73b9125d829529fc Mon Sep 17 00:00:00 2001 From: Mprotecter <827289858@qq.com> Date: Sat, 16 May 2020 22:57:55 +0800 Subject: [PATCH 3/6] =?UTF-8?q?0516=5F=E5=B0=8F=E5=81=B7=EF=BC=88dp?= =?UTF-8?q?=EF=BC=89?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- "LiYu/198_\345\260\217\345\201\267.md" | 27 ++++++++++++++++++++++++++ README.md | 2 +- 2 files changed, 28 insertions(+), 1 deletion(-) create mode 100644 "LiYu/198_\345\260\217\345\201\267.md" diff --git "a/LiYu/198_\345\260\217\345\201\267.md" "b/LiYu/198_\345\260\217\345\201\267.md" new file mode 100644 index 0000000..45c8dc6 --- /dev/null +++ "b/LiYu/198_\345\260\217\345\201\267.md" @@ -0,0 +1,27 @@ +class Solution { + + public int rob(int[] nums) { + +​ if(nums.length == 0) return 0; + +​ int[] money = new int[nums.length+1]; + +​ //起始条件 + +​ money[0] = 0; + +​ money[1] = nums[0]; + +​ for(int i = 2; i <= nums.length; i++){ + +​ //上一家的值还是 上上家偷上一家的值 + +​ money[i] = Math.max(money[i - 1], money[i - 2] + nums[i - 1]); + +​ } + +​ return money[nums.length]; + + } + +} \ No newline at end of file diff --git a/README.md b/README.md index 50a8749..324a1bf 100644 --- a/README.md +++ b/README.md @@ -63,7 +63,7 @@ | 5.13 | 3.无重复字符的最长字串 | 1277. 统计全为 1 的正方形子矩阵 | | | | | | 5.14 | | 1024. 视频拼接（待完成） | | | | | | 5.15 | | 121.买卖股票 | | | | | -| 5.16 | | | | | | | +| 5.16 | | 198.打家劫舍 | | | | | | 5.17 | | | | | | | | 5.18 | | | | | | | | 5.19 | | | | | | | From 2aaed048dc779451260de1e62d2d69185893f7ea Mon Sep 17 00:00:00 2001 From: Mprotecter <827289858@qq.com> Date: Sun, 17 May 2020 22:38:34 +0800 Subject: [PATCH 4/6] =?UTF-8?q?=E6=89=93=E5=AE=B6=E5=8A=AB=E8=88=8D2=20213?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...3_\346\211\223\345\212\253\342\221\241.md" | 43 +++++++++++++++++++ README.md | 2 +- 2 files changed, 44 insertions(+), 1 deletion(-) create mode 100644 "LiYu/213_\346\211\223\345\212\253\342\221\241.md" diff --git "a/LiYu/213_\346\211\223\345\212\253\342\221\241.md" "b/LiYu/213_\346\211\223\345\212\253\342\221\241.md" new file mode 100644 index 0000000..04cef18 --- /dev/null +++ "b/LiYu/213_\346\211\223\345\212\253\342\221\241.md" @@ -0,0 +1,43 @@ +```java +class Solution { + public int rob(int[] nums) { + if(nums.length==0){ + return 0; + } + if(nums.length==1){ + return nums[0]; + } + int dp_i_2=0; + int dp_i_1=0; + int dp_max1=nums[0]; + int dp_max2=nums[1]; + for(int i=1;idp_i_1){ + dp_max1=dp_i_2+nums[i]; + + }else{ + dp_max1=dp_i_1; + } + } + + dp_i_1=0; + dp_i_2=0; + for(int i=2;idp_i_1){ + dp_max2=dp_i_2+nums[i]; + + }else{ + dp_max2=dp_i_1; + } + } + return Math.max(dp_max1,dp_max2); + + } +} +``` + + diff --git a/README.md b/README.md index 324a1bf..21dc4fb 100644 --- a/README.md +++ b/README.md @@ -64,7 +64,7 @@ | 5.14 | | 1024. 视频拼接（待完成） | | | | | | 5.15 | | 121.买卖股票 | | | | | | 5.16 | | 198.打家劫舍 | | | | | -| 5.17 | | | | | | | +| 5.17 | | 213.打家劫舍2 | | | | | | 5.18 | | | | | | | | 5.19 | | | | | | | | 5.20 | | | | | | | From e9cf24871aadf77f0d88434de70c7f84a18696bc Mon Sep 17 00:00:00 2001 From: Mprotecter <827289858@qq.com> Date: Tue, 19 May 2020 22:08:37 +0800 Subject: [PATCH 5/6] =?UTF-8?q?=E6=9C=AC=E5=91=A8=E8=AF=B7=E5=81=87?= =?UTF-8?q?=E8=83=8C=E7=A7=91=E7=9B=AE=E4=B8=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...7\274\214\350\203\214\347\247\221\347\233\256\344\270\200.txt" | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 "LiYu/\346\234\254\345\221\250\350\257\267\345\201\207\357\274\214\350\203\214\347\247\221\347\233\256\344\270\200.txt" diff --git "a/LiYu/\346\234\254\345\221\250\350\257\267\345\201\207\357\274\214\350\203\214\347\247\221\347\233\256\344\270\200.txt" "b/LiYu/\346\234\254\345\221\250\350\257\267\345\201\207\357\274\214\350\203\214\347\247\221\347\233\256\344\270\200.txt" new file mode 100644 index 0000000..e69de29 From 46b529fb008131eb76b1738529f0c57eebb62d0b Mon Sep 17 00:00:00 2001 From: Mprotecter <827289858@qq.com> Date: Mon, 25 May 2020 22:13:57 +0800 Subject: [PATCH 6/6] =?UTF-8?q?62=5F=E4=B8=8D=E5=90=8C=E8=B7=AF=E5=BE=84?= =?UTF-8?q?=E2=80=94=E2=80=94=E6=9C=BA=E5=99=A8=E4=BA=BA?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...0\215\345\220\214\350\267\257\345\276\204.md" | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 "LiYu/62_\344\270\215\345\220\214\350\267\257\345\276\204.md" diff --git "a/LiYu/62_\344\270\215\345\220\214\350\267\257\345\276\204.md" "b/LiYu/62_\344\270\215\345\220\214\350\267\257\345\276\204.md" new file mode 100644 index 0000000..3e7e111 --- /dev/null +++ "b/LiYu/62_\344\270\215\345\220\214\350\267\257\345\276\204.md" @@ -0,0 +1,16 @@ +```java +class Solution { + public int uniquePaths(int m, int n) { + int[][] dp = new int[m][n]; + for (int i = 0; i < n; i++) dp[0][i] = 1; + for (int i = 0; i < m; i++) dp[i][0] = 1; + for (int i = 1; i < m; i++) { + for (int j = 1; j < n; j++) { + dp[i][j] = dp[i - 1][j] + dp[i][j - 1]; + } + } + return dp[m - 1][n - 1]; + } +} +``` +