feat: update solutions to lc problem: No.1033

Author: thinkasany

solution/1000-1099/1033.Moving Stones Until Consecutive/README.md

@@ -149,6 +149,23 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numMovesStones(a: number, b: number, c: number): number[] {
+    const x = Math.min(a, Math.min(b, c));
+    const z = Math.max(a, Math.max(b, c));
+    const y = a + b + c - x - z;
+    let mi = 0,
+        mx = 0;
+    if (z - x > 2) {
+        mi = y - x < 3 || z - y < 3 ? 1 : 2;
+        mx = z - x - 2;
+    }
+    return [mi, mx];
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1033.Moving Stones Until Consecutive/README_EN.md

@@ -138,6 +138,23 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numMovesStones(a: number, b: number, c: number): number[] {
+    const x = Math.min(a, Math.min(b, c));
+    const z = Math.max(a, Math.max(b, c));
+    const y = a + b + c - x - z;
+    let mi = 0,
+        mx = 0;
+    if (z - x > 2) {
+        mi = y - x < 3 || z - y < 3 ? 1 : 2;
+        mx = z - x - 2;
+    }
+    return [mi, mx];
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1033.Moving Stones Until Consecutive/Solution.ts

@@ -0,0 +1,12 @@
+function numMovesStones(a: number, b: number, c: number): number[] {
+    const x = Math.min(a, Math.min(b, c));
+    const z = Math.max(a, Math.max(b, c));
+    const y = a + b + c - x - z;
+    let mi = 0,
+        mx = 0;
+    if (z - x > 2) {
+        mi = y - x < 3 || z - y < 3 ? 1 : 2;
+        mx = z - x - 2;
+    }
+    return [mi, mx];
+}