Update 04.Array-Shell-Sort.md

Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md

@@ -24,19 +24,23 @@
 ## 5. 代码实现
 
 ```Python
-def shellSort(arr):
-	size = len(arr)
-    gap = size // 2
-
-    while gap > 0:
-        for i in range(gap, size):
-            temp = arr[i]
-            j = i
-            while j >= gap and arr[j - gap] > temp:
-                arr[j] = arr[j - gap]
-                j -= gap
-            arr[j] = temp
-        gap = gap // 2
-    return arr
+class Solution:
+    def shellSort(self, arr):
+        size = len(arr)
+        gap = size // 2
+
+        while gap > 0:
+            for i in range(gap, size):
+                temp = arr[i]
+                j = i
+                while j >= gap and arr[j - gap] > temp:
+                    arr[j] = arr[j - gap]
+                    j -= gap
+                arr[j] = temp
+            gap = gap // 2
+        return arr
+
+    def sortArray(self, nums: List[int]) -> List[int]:
+        return self.shellSort(nums)
 ```