Update 0561 solution

Author: halfrost

leetcode/0561.Array-Partition-I/561. Array Partition I.go renamed to leetcode/0561.Array-Partition/561. Array Partition.go

@@ -1,4 +1,4 @@
-# [561. Array Partition I](https://leetcode.com/problems/array-partition-i/)
+# [561. Array Partition](https://leetcode.com/problems/array-partition/)
 
 
 ## 题目

leetcode/0561.Array-Partition-I/561. Array Partition I_test.go renamed to leetcode/0561.Array-Partition/561. Array Partition_test.go

@@ -61,5 +61,5 @@ func subarraySum(nums []int, k int) int {
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree/">⬅️上一页</a></p>
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0561.Array-Partition-I/">下一页➡️</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0561.Array-Partition/">下一页➡️</a></p>
 </div>

leetcode/0561.Array-Partition-I/README.md renamed to leetcode/0561.Array-Partition/README.md

@@ -1,4 +1,4 @@
-# [561. Array Partition I](https://leetcode.com/problems/array-partition-i/)
+# [561. Array Partition](https://leetcode.com/problems/array-partition/)
 
 
 ## 题目

website/content/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md

@@ -85,6 +85,6 @@ func findTiltDFS(root *TreeNode, sum *int) int {
 
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0561.Array-Partition-I/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0561.Array-Partition/">⬅️上一页</a></p>
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0566.Reshape-the-Matrix/">下一页➡️</a></p>
 </div>