feat: add solutions to lc problems: No.1015,1017,1073,2109 (#910)

* No.1015.Smallest Integer Divisible by K
* No.1017.Convert to Base -2
* No.1073.Adding Two Negabinary Numbers
* No.2109.Adding Spaces to a String

Author: thinkasany

solution/1000-1099/1015.Smallest Integer Divisible by K/README.md

@@ -124,6 +124,21 @@ func smallestRepunitDivByK(k int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function smallestRepunitDivByK(k: number): number {
+    let n = 1 % k;
+    for (let i = 1; i <= k; ++i) {
+        if (n === 0) {
+            return i;
+        }
+        n = (n * 10 + 1) % k;
+    }
+    return -1;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1015.Smallest Integer Divisible by K/README_EN.md

@@ -109,6 +109,21 @@ func smallestRepunitDivByK(k int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function smallestRepunitDivByK(k: number): number {
+    let n = 1 % k;
+    for (let i = 1; i <= k; ++i) {
+        if (n === 0) {
+            return i;
+        }
+        n = (n * 10 + 1) % k;
+    }
+    return -1;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1015.Smallest Integer Divisible by K/Solution.ts

@@ -0,0 +1,10 @@
+function smallestRepunitDivByK(k: number): number {
+    let n = 1 % k;
+    for (let i = 1; i <= k; ++i) {
+        if (n === 0) {
+            return i;
+        }
+        n = (n * 10 + 1) % k;
+    }
+    return -1;
+}

solution/1000-1099/1017.Convert to Base -2/README.md

@@ -162,6 +162,29 @@ func baseNeg2(n int) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function baseNeg2(n: number): string {
+    if (n === 0) {
+        return '0';
+    }
+    let k = 1;
+    let ans: string[] = [];
+    while (n) {
+        if (n % 2) {
+            ans.push('1');
+            n -= k;
+        } else {
+            ans.push('0');
+        }
+        k *= -1;
+        n /= 2;
+    }
+    return ans.reverse().join('');
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1017.Convert to Base -2/README_EN.md

@@ -140,6 +140,29 @@ func baseNeg2(n int) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function baseNeg2(n: number): string {
+    if (n === 0) {
+        return '0';
+    }
+    let k = 1;
+    let ans: string[] = [];
+    while (n) {
+        if (n % 2) {
+            ans.push('1');
+            n -= k;
+        } else {
+            ans.push('0');
+        }
+        k *= -1;
+        n /= 2;
+    }
+    return ans.reverse().join('');
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1017.Convert to Base -2/Solution.ts

@@ -0,0 +1,18 @@
+function baseNeg2(n: number): string {
+    if (n === 0) {
+        return '0';
+    }
+    let k = 1;
+    let ans: string[] = [];
+    while (n) {
+        if (n % 2) {
+            ans.push('1');
+            n -= k;
+        } else {
+            ans.push('0');
+        }
+        k *= -1;
+        n /= 2;
+    }
+    return ans.reverse().join('');
+}

solution/1000-1099/1073.Adding Two Negabinary Numbers/README.md

@@ -194,6 +194,35 @@ func addNegabinary(arr1 []int, arr2 []int) (ans []int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function addNegabinary(arr1: number[], arr2: number[]): number[] {
+    let i = arr1.length - 1,
+        j = arr2.length - 1;
+    const ans: number[] = [];
+    for (let c = 0; i >= 0 || j >= 0 || c; --i, --j) {
+        const a = i < 0 ? 0 : arr1[i];
+        const b = j < 0 ? 0 : arr2[j];
+        let x = a + b + c;
+        c = 0;
+        if (x > 1) {
+            x -= 2;
+            c -= 1;
+        }
+        if (x < 0) {
+            x += 2;
+            c += 1;
+        }
+        ans.push(x);
+    }
+    while (ans.length > 1 && ans[ans.length - 1] === 0) {
+        ans.pop();
+    }
+    return ans.reverse();
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1073.Adding Two Negabinary Numbers/README_EN.md

@@ -169,6 +169,35 @@ func addNegabinary(arr1 []int, arr2 []int) (ans []int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function addNegabinary(arr1: number[], arr2: number[]): number[] {
+    let i = arr1.length - 1,
+        j = arr2.length - 1;
+    const ans: number[] = [];
+    for (let c = 0; i >= 0 || j >= 0 || c; --i, --j) {
+        const a = i < 0 ? 0 : arr1[i];
+        const b = j < 0 ? 0 : arr2[j];
+        let x = a + b + c;
+        c = 0;
+        if (x > 1) {
+            x -= 2;
+            c -= 1;
+        }
+        if (x < 0) {
+            x += 2;
+            c += 1;
+        }
+        ans.push(x);
+    }
+    while (ans.length > 1 && ans[ans.length - 1] === 0) {
+        ans.pop();
+    }
+    return ans.reverse();
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1073.Adding Two Negabinary Numbers/Solution.ts

@@ -0,0 +1,24 @@
+function addNegabinary(arr1: number[], arr2: number[]): number[] {
+    let i = arr1.length - 1,
+        j = arr2.length - 1;
+    const ans: number[] = [];
+    for (let c = 0; i >= 0 || j >= 0 || c; --i, --j) {
+        const a = i < 0 ? 0 : arr1[i];
+        const b = j < 0 ? 0 : arr2[j];
+        let x = a + b + c;
+        c = 0;
+        if (x > 1) {
+            x -= 2;
+            c -= 1;
+        }
+        if (x < 0) {
+            x += 2;
+            c += 1;
+        }
+        ans.push(x);
+    }
+    while (ans.length > 1 && ans[ans.length - 1] === 0) {
+        ans.pop();
+    }
+    return ans.reverse();
+}

solution/2100-2199/2109.Adding Spaces to a String/README.md

@@ -162,7 +162,17 @@ func addSpaces(s string, spaces []int) string {
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```ts
-
+function addSpaces(s: string, spaces: number[]): string {
+    let ans = '';
+    for (let i = 0, j = 0; i < s.length; i++) {
+        if (j < spaces.length && i === spaces[j]) {
+            ans += ' ';
+            ++j;
+        }
+        ans += s[i];
+    }
+    return ans;
+}
 ```
 
 ### **...**