feat: add solutions to lc problem: No.2269 & No.2270

solution/2200-2299/2269.Find the K-Beauty of a Number/README.md

@@ -71,15 +71,35 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def divisorSubstrings(self, num: int, k: int) -> int:
+        cnt = 0
+        s = str(num)
+        for i in range(len(s) - k + 1):
+            tmp = int(s[i: i + k])
+            if tmp != 0 and num % tmp == 0:
+                cnt += 1
+        return cnt
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int divisorSubstrings(int num, int k) {
+        int cnt = 0;
+        String s = String.valueOf(num);
+        for (int i = 0; i <= s.length() - k; i++) {
+            int tmp = Integer.parseInt(s.substring(i, i + k));
+            if (tmp != 0 && num % tmp == 0) {
+                cnt++;
+            }
+        }
+        return cnt;
+    }
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2269.Find the K-Beauty of a Number/README_EN.md

@@ -63,13 +63,33 @@ Therefore, the k-beauty is 2.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def divisorSubstrings(self, num: int, k: int) -> int:
+        cnt = 0
+        s = str(num)
+        for i in range(len(s) - k + 1):
+            tmp = int(s[i: i + k])
+            if tmp != 0 and num % tmp == 0:
+                cnt += 1
+        return cnt
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int divisorSubstrings(int num, int k) {
+        int cnt = 0;
+        String s = String.valueOf(num);
+        for (int i = 0; i <= s.length() - k; i++) {
+            int tmp = Integer.parseInt(s.substring(i, i + k));
+            if (tmp != 0 && num % tmp == 0) {
+                cnt++;
+            }
+        }
+        return cnt;
+    }
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2269.Find the K-Beauty of a Number/Solution.java

@@ -0,0 +1,13 @@
+class Solution {
+    public int divisorSubstrings(int num, int k) {
+        int cnt = 0;
+        String s = String.valueOf(num);
+        for (int i = 0; i <= s.length() - k; i++) {
+            int tmp = Integer.parseInt(s.substring(i, i + k));
+            if (tmp != 0 && num % tmp == 0) {
+                cnt++;
+            }
+        }
+        return cnt;
+    }
+}

solution/2200-2299/2269.Find the K-Beauty of a Number/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def divisorSubstrings(self, num: int, k: int) -> int:
+        cnt = 0
+        s = str(num)
+        for i in range(len(s) - k + 1):
+            tmp = int(s[i: i + k])
+            if tmp != 0 and num % tmp == 0:
+                cnt += 1
+        return cnt

solution/2200-2299/2270.Number of Ways to Split Array/README.md

@@ -62,15 +62,38 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def waysToSplitArray(self, nums: List[int]) -> int:
+        left, right = 0, sum(nums)
+        cnt = 0
+        for v in nums[:-1]:
+            left += v
+            right -= v
+            if left >= right:
+                cnt += 1
+        return cnt
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int waysToSplitArray(int[] nums) {
+        long[] pre = new long[nums.length + 1];
+        for (int i = 0; i < nums.length; i++) {
+            pre[i + 1] = pre[i] + nums[i];
+        }
+        int cnt = 0;
+        for (int i = 1; i < nums.length; i++) {
+            if (pre[i] >= pre[nums.length] - pre[i]) {
+                cnt++;
+            }
+        }
+        return cnt;
+    }
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2270.Number of Ways to Split Array/README_EN.md

@@ -55,13 +55,36 @@ There are two valid splits in nums:
 ### **Python3**
 
 ```python
-
+class Solution:
+    def waysToSplitArray(self, nums: List[int]) -> int:
+        left, right = 0, sum(nums)
+        cnt = 0
+        for v in nums[:-1]:
+            left += v
+            right -= v
+            if left >= right:
+                cnt += 1
+        return cnt
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int waysToSplitArray(int[] nums) {
+        long[] pre = new long[nums.length + 1];
+        for (int i = 0; i < nums.length; i++) {
+            pre[i + 1] = pre[i] + nums[i];
+        }
+        int cnt = 0;
+        for (int i = 1; i < nums.length; i++) {
+            if (pre[i] >= pre[nums.length] - pre[i]) {
+                cnt++;
+            }
+        }
+        return cnt;
+    }
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2270.Number of Ways to Split Array/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int waysToSplitArray(int[] nums) {
+        long[] pre = new long[nums.length + 1];
+        for (int i = 0; i < nums.length; i++) {
+            pre[i + 1] = pre[i] + nums[i];
+        }
+        int cnt = 0;
+        for (int i = 1; i < nums.length; i++) {
+            if (pre[i] >= pre[nums.length] - pre[i]) {
+                cnt++;
+            }
+        }
+        return cnt;
+    }
+}

solution/2200-2299/2270.Number of Ways to Split Array/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def waysToSplitArray(self, nums: List[int]) -> int:
+        left, right = 0, sum(nums)
+        cnt = 0
+        for v in nums[:-1]:
+            left += v
+            right -= v
+            if left >= right:
+                cnt += 1
+        return cnt