fix: #595

ikesnowy · Mar 13, 2022 · c342ee6 · c342ee6
1 parent 60dcf55
commit c342ee6
Show file tree

Hide file tree

Showing 8 changed files with 7 additions and 43 deletions.
diff --git a/1 Fundamental/1.4/1.4.15/Program.cs b/1 Fundamental/1.4/1.4.15/Program.cs
@@ -60,7 +60,7 @@ static int ThreeSumFaster(int[] a)
     {
         var lo = i + 1;
         var hi = a.Length - 1;
-        while (lo <= hi)
+        while (lo < hi)
         {
             if (a[lo] + a[hi] + a[i] == 0)
             {

diff --git a/1 Fundamental/1.4/1.4.20/Program.cs b/1 Fundamental/1.4/1.4.20/Program.cs
@@ -44,7 +44,7 @@ static int BinarySearchAscending(int[] a, int key, int lo, int hi)
 
 static int BinarySearchDescending(int[] a, int key, int lo, int hi)
 {
-    while (lo < hi)
+    while (lo <= hi)
     {
         var mid = lo + (hi - lo) / 2;
 

diff --git a/Alg4.sln b/Alg4.sln
@@ -14,7 +14,6 @@ Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "文档", "文档", "{4972DB
 		C# 框架设计指南.md = C# 框架设计指南.md
 		LICENSE.md = LICENSE.md
 		README.md = README.md
-		THANKS.md = THANKS.md
 	EndProjectSection
 EndProject
 Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "2-提高题（1.1.26~1.1.34）", "2-提高题（1.1.26~1.1.34）", "{002EC4CB-C2EB-42C4-BA8F-6F6C2B62172C}"

diff --git a/README.md b/README.md
@@ -1,6 +1,6 @@
 # Algorithms-4th-Edition in C#
 
-算法（第4版）习题题解 C# 版，勘误感谢名单：[THANKS.md](https://github.com/ikesnowy/Algorithms-4th-Edition-in-Csharp/blob/master/THANKS.md)
+算法（第4版）习题题解 C# 版，勘误感谢名单：[THANKS.md](https://github.com/ikesnowy/Algorithms-4th-Edition-in-Csharp/blob/master/docs/content/thanks.md)
 
 当前已经完成到 3.2。
 

diff --git a/THANKS.md b/THANKS.md
diff --git a/docs/content/1-4-15.md b/docs/content/1-4-15.md
@@ -74,7 +74,7 @@ static int ThreeSumFaster(int[] a)
     {
         var lo = i + 1;
         var hi = a.Length - 1;
-        while (lo <= hi)
+        while (lo < hi)
         {
             if (a[lo] + a[hi] + a[i] == 0)
             {

diff --git a/docs/content/1-4-20.md b/docs/content/1-4-20.md
@@ -124,7 +124,7 @@ static int BinarySearchAscending(int[] a, int key, int lo, int hi)
 
 static int BinarySearchDescending(int[] a, int key, int lo, int hi)
 {
-    while (lo < hi)
+    while (lo <= hi)
     {
         var mid = lo + (hi - lo) / 2;
 

diff --git a/docs/content/thanks.md b/docs/content/thanks.md
@@ -24,6 +24,8 @@ weight: 1
 
 [@Hao Liu](https://github.com/Higurashi-kagome), 公式渲染问题 [#596](https://github.com/ikesnowy/Algorithms-4th-Edition-in-Csharp/issues/596), [#594](https://github.com/ikesnowy/Algorithms-4th-Edition-in-Csharp/issues/594)
 
+[@Hao Liu](https://github.com/Higurashi-kagome), 1.4.15, 1.4.20, [#595](https://github.com/ikesnowy/Algorithms-4th-Edition-in-Csharp/issues/595)
+
 ## 第二章
 
 [@雨碎江南](https://github.com/consoles) ，2.2.12 [#532](https://github.com/ikesnowy/Algorithms-4th-Edition-in-Csharp/issues/532)