feat: add typescript solution to lc problem: No.1590 (doocs#637)

No.1590.Make Sum Divisible by P

Author: zhaocchen

solution/1500-1599/1590.Make Sum Divisible by P/README.md

@@ -81,6 +81,38 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function minSubarray(nums: number[], p: number): number {
+    const n = nums.length;
+    let mod = 0;
+    for (let i = 0; i < n; i++) {
+        mod = (nums[i] + mod) % p;
+    }
+    if (!mod) return 0;
+
+    let hashMap = new Map<number, number>();
+    hashMap.set(0, -1);
+    let ans = n;
+    let subMod = 0;
+    for (let i = 0; i < n; i++) {
+        let cur = nums[i];
+        subMod = (subMod + cur) % p;
+        let target = (subMod - mod + p) % p;
+        if (hashMap.has(target)) {
+            let j = hashMap.get(target);
+            ans = Math.min(i - j, ans);
+            if (ans == 1 && ans != n) {
+                return ans;
+            }
+        }
+        hashMap.set(subMod, i);
+    }
+    return ans == n ? -1 : ans;
+};
+```
+
 ### **...**
 
 ```

solution/1500-1599/1590.Make Sum Divisible by P/README_EN.md

@@ -124,6 +124,38 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function minSubarray(nums: number[], p: number): number {
+    const n = nums.length;
+    let mod = 0;
+    for (let i = 0; i < n; i++) {
+        mod = (nums[i] + mod) % p;
+    }
+    if (!mod) return 0;
+
+    let hashMap = new Map<number, number>();
+    hashMap.set(0, -1);
+    let ans = n;
+    let subMod = 0;
+    for (let i = 0; i < n; i++) {
+        let cur = nums[i];
+        subMod = (subMod + cur) % p;
+        let target = (subMod - mod + p) % p;
+        if (hashMap.has(target)) {
+            let j = hashMap.get(target);
+            ans = Math.min(i - j, ans);
+            if (ans == 1 && ans != n) {
+                return ans;
+            }
+        }
+        hashMap.set(subMod, i);
+    }
+    return ans == n ? -1 : ans;
+};
+```
+
 ### **...**
 
 ```

solution/1500-1599/1590.Make Sum Divisible by P/Solution.ts

@@ -0,0 +1,27 @@
+function minSubarray(nums: number[], p: number): number {
+    const n = nums.length;
+    let mod = 0;
+    for (let i = 0; i < n; i++) {
+        mod = (nums[i] + mod) % p;
+    }
+    if (!mod) return 0;
+
+    let hashMap = new Map<number, number>();
+    hashMap.set(0, -1);
+    let ans = n;
+    let subMod = 0;
+    for (let i = 0; i < n; i++) {
+        let cur = nums[i];
+        subMod = (subMod + cur) % p;
+        let target = (subMod - mod + p) % p;
+        if (hashMap.has(target)) {
+            let j = hashMap.get(target);
+            ans = Math.min(i - j, ans);
+            if (ans == 1 && ans != n) {
+                return ans;
+            }
+        }
+        hashMap.set(subMod, i);
+    }
+    return ans == n ? -1 : ans;
+};