From 3d87b36ad7681d4c3dae40529b41506c7a383554 Mon Sep 17 00:00:00 2001
From: Haitao Lu <lht19900714@gmail.com>
Date: Thu, 29 Dec 2022 00:20:09 +0800
Subject: [PATCH 1/4] =?UTF-8?q?=E5=9C=A8=E5=9B=BE=E7=89=87=E5=92=8C?=
 =?UTF-8?q?=E6=96=87=E5=AD=97=E6=AE=B5=E8=90=BD=E4=B8=AD=E5=A2=9E=E5=8A=A0?=
 =?UTF-8?q?=E4=B8=80=E4=B8=AA=E7=A9=BA=E8=A1=8C,=20=E4=BD=BF=E6=96=87?=
 =?UTF-8?q?=E5=AD=97=E6=AE=B5=E8=90=BD=E5=8F=AF=E4=BB=A5=E6=96=B0=E8=B5=B7?=
 =?UTF-8?q?=E4=B8=80=E8=A1=8C.=20=E5=A6=82=E6=9E=9C=E4=B8=8D=E5=A2=9E?=
 =?UTF-8?q?=E5=8A=A0=E7=A9=BA=E8=A1=8C,=20=E6=96=87=E5=AD=97=E6=AE=B5?=
 =?UTF-8?q?=E8=90=BD=E4=BC=9A=E8=B7=9F=E5=9C=A8=E5=9B=BE=E7=89=87=E5=90=8E?=
 =?UTF-8?q?=E9=9D=A2.?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0028.实现strStr.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/problems/0028.实现strStr.md b/problems/0028.实现strStr.md
index fc222441..4e01926f 100644
--- a/problems/0028.实现strStr.md
+++ b/problems/0028.实现strStr.md
@@ -174,9 +174,11 @@ next数组就是一个前缀表（prefix table）。
 长度为前1个字符的子串`a`，最长相同前后缀的长度为0。（注意字符串的**前缀是指不包含最后一个字符的所有以第一个字符开头的连续子串**；**后缀是指不包含第一个字符的所有以最后一个字符结尾的连续子串**。）
 
 <img src='https://code-thinking.cdn.bcebos.com/pics/KMP%E7%B2%BE%E8%AE%B26.png' width=600 alt='KMP精讲6'> </img></div>
+
 长度为前2个字符的子串`aa`，最长相同前后缀的长度为1。
 
 <img src='https://code-thinking.cdn.bcebos.com/pics/KMP%E7%B2%BE%E8%AE%B27.png' width=600 alt='KMP精讲7'> </img></div>
+
 长度为前3个字符的子串`aab`，最长相同前后缀的长度为0。
 
 以此类推：

From e7f3ecc58a575334ef02cada1407daa6c0d6d590 Mon Sep 17 00:00:00 2001
From: picassoboss <111678738+picassoboss@users.noreply.github.com>
Date: Fri, 30 Dec 2022 14:12:01 +0800
Subject: [PATCH 2/4] =?UTF-8?q?Update=200494.=E7=9B=AE=E6=A0=87=E5=92=8C.m?=
 =?UTF-8?q?d?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

java代码部分无法通过leetcode提交,需要先判断sum是否可以满足target
---
 problems/0494.目标和.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/problems/0494.目标和.md b/problems/0494.目标和.md
index 6c8c28ec..eec4183d 100644
--- a/problems/0494.目标和.md
+++ b/problems/0494.目标和.md
@@ -270,6 +270,8 @@ class Solution {
     public int findTargetSumWays(int[] nums, int target) {
         int sum = 0;
         for (int i = 0; i < nums.length; i++) sum += nums[i];
+	//如果target过大 sum将无法满足
+        if ( target < 0 && sum < -target) return 0;
         if ((target + sum) % 2 != 0) return 0;
         int size = (target + sum) / 2;
         if(size < 0) size = -size;

From 15e3377491590fceee2af002803183bd6f15e236 Mon Sep 17 00:00:00 2001
From: re1own <595875338@qq.com>
Date: Fri, 30 Dec 2022 01:42:47 -0500
Subject: [PATCH 3/4] =?UTF-8?q?Update=200518.=E9=9B=B6=E9=92=B1=E5=85=91?=
 =?UTF-8?q?=E6=8D=A2II.md=20=E5=AF=B9dp[0]=3D1=E7=9A=84=E8=A1=A5=E5=85=85?=
 =?UTF-8?q?=E8=A7=A3=E9=87=8A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .DS_Store                       | Bin 0 -> 6148 bytes
 problems/.DS_Store              | Bin 0 -> 6148 bytes
 problems/0518.零钱兑换II.md |   3 +++
 3 files changed, 3 insertions(+)
 create mode 100644 .DS_Store
 create mode 100644 problems/.DS_Store

diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..da03c1c1b207c3ee04079084ecb15dcfff97ef95
GIT binary patch
literal 6148
zcmeHK%}T>S5T317Q;OJwLXQhx3-<3)^bl)(0V4`psf{T$m}X1UTBH<m6ZB!c`T#zI
zuOPmKvp*Fj6}%`aGcfzj&d%&+zl7Zk0I>SVD*@yHz(SRn%3w1`<hay?q>N_?k*PTX
z=s*u5cO3N-(d77z49It9K_3Pnz=e13&kcl&V-IdW@S|a|_{35R>BXgGl<e}Ub0Nmg
zuss|__4eRI_6~#y+?m~W5B<)#m0Q~t;jrz8oq<a5y$*&nkNnUR<GL7yUZipzJ&-|Z
z<?@qBrB*HQYPmWs@JX#)M7vg=PBYf}#^%<3>oVwt;#QN%@Vis8VsHj`Xe9O(bW6^;
z=;?2>^71?{rY9N=vv=!y_4uZF|F|<h&ihha|Ki=6+Z?A#KG&5q2m=vzacs698An14
z5Cg=(cQIhj8Y}x<3(&m805R}q8Ib1#N0n$Bj5VsG0~=KWAg0l+1Z`PM$Q*9aHW+Kf
z5fr9V5p^mvB?i;!=;tQRHW+Kv>A+0!!OY6cR47cXj`MRB4$Rg_Eiph0d}LrjcXRUo
z-}}7&|CmHQVt^R<R}8Rp!)erUOXhA(Y);;_9Q6!Uij0djzNMg{u40UpS8*Oy3HrG-
W5N(68M)aW2kAR|q8e-r_8F&SXo^XBu

literal 0
HcmV?d00001

diff --git a/problems/.DS_Store b/problems/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..32266f382acd7b944a23d2f5f05301bbed6d4e0f
GIT binary patch
literal 6148
zcmeHKu}Z{15S`7Xh^TO-<^Doyn|MS!8_z;f<U9{O;X+Q(R?=CDtv_Mw2lxSkm7R^>
zVC$RRxm?z$r5rK?vu`uAlgGY<OqPgD?`o71b%`i}Ge%1ozA?_Tw=9y#3efO9CTD5?
zq%5Ybl^R%71^C&;bV28INyp*y+q!S&iZaiKlX8ey^7_7abNKMI5#~p~=BMN4yD>m1
zMLXL^w*hCgdN+$V`92QzXMC=vDCb;Xa{*8E#yp+f@nHS>C1gr@Cz5G$oj%rFb#~6y
z&W3!?%%`Rbr~<0MqAP%&&6X^C)KL{s1yq4r0scN%IAbPQd32u+4DJX3j1hK*IiDrC
z#tLSFl}BV?#+L$psgWaw@#TnHS(gb`9(_3($Bg?3vyl^uaqNg&x13DoQAbrk6$lmR
z_{%Q$|IMGz|6!3{sRF9Nzf!=&c|Y%AOVV3go8w+<;R84uud6)PC78HYjJ4c~*Wk_&
Yw>$x6f|W-^VEQBAWY9qs_)`Tw0S;+s82|tP

literal 0
HcmV?d00001

diff --git a/problems/0518.零钱兑换II.md b/problems/0518.零钱兑换II.md
index 2fc807cd..f6a8044c 100644
--- a/problems/0518.零钱兑换II.md
+++ b/problems/0518.零钱兑换II.md
@@ -95,6 +95,8 @@ dp[j]  就是所有的dp[j - coins[i]]（考虑coins[i]的情况）相加。
 
 下标非0的dp[j]初始化为0，这样累计加dp[j - coins[i]]的时候才不会影响真正的dp[j]
 
+dp[0]=1还说明了一种情况：如果正好选了coins[i]后，也就是j-coins[i] == 0的情况表示这个硬币刚好能选，此时dp[0]为1表示只选coins[i]存在这样的一种选法。
+
 4. 确定遍历顺序
 
 本题中我们是外层for循环遍历物品（钱币），内层for遍历背包（金钱总额），还是外层for遍历背包（金钱总额），内层for循环遍历物品（钱币）呢？
@@ -316,3 +318,4 @@ object Solution {
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
 </a>
+

From 2cd16202f48ae765049c00a1a773214033b0e127 Mon Sep 17 00:00:00 2001
From: El nino <69737612+el-nino2020@users.noreply.github.com>
Date: Mon, 2 Jan 2023 16:39:24 +0800
Subject: [PATCH 4/4] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 3b0e8d65..a04f58a6 100644
--- a/README.md
+++ b/README.md
@@ -131,7 +131,7 @@
 1. [数组过于简单，但你该了解这些！](./problems/数组理论基础.md) 
 2. [数组：二分查找](./problems/0704.二分查找.md)
 3. [数组：移除元素](./problems/0027.移除元素.md)
-4. [数组：序数组的平方](./problems/0977.有序数组的平方.md)    
+4. [数组：有序数组的平方](./problems/0977.有序数组的平方.md)    
 5. [数组：长度最小的子数组](./problems/0209.长度最小的子数组.md)
 6. [数组：螺旋矩阵II](./problems/0059.螺旋矩阵II.md)
 7. [数组：总结篇](./problems/数组总结篇.md)