feat: add solutions to lc problem: No.1513

No.1513.Number of Substrings With Only 1s

Author: yanglbme

solution/1500-1599/1513.Number of Substrings With Only 1s/README.md

@@ -56,22 +56,99 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：遍历计数**
+
+我们遍历字符串 $s$，用变量 $cnt$ 记录当前连续的 1 的个数，用变量 $ans$ 记录答案。当遍历到字符 $s[i]$ 时，如果 $s[i] = 1$，则 $cnt$ 自增 1，否则 $cnt$ 置 0。���时，$ans$ 自增 $cnt$。
+
+最后，返回 $ans$ 即可。
+
+时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为字符串 $s$ 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def numSub(self, s: str) -> int:
+        ans = cnt = 0
+        for c in s:
+            if c == "1":
+                cnt += 1
+            else:
+                cnt = 0
+            ans += cnt
+        return ans % (10**9 + 7)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int numSub(String s) {
+        final int mod = (int) 1e9 + 7;
+        int ans = 0, cnt = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            cnt = s.charAt(i) == '1' ? cnt + 1 : 0;
+            ans = (ans + cnt) % mod;
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numSub(string s) {
+        int ans = 0, cnt = 0;
+        const int mod = 1e9 + 7;
+        for (char& c : s) {
+            cnt = c == '1' ? cnt + 1 : 0;
+            ans = (ans + cnt) % mod;
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func numSub(s string) (ans int) {
+	const mod = 1e9 + 7
+	cnt := 0
+	for _, c := range s {
+		if c == '1' {
+			cnt++
+		} else {
+			cnt = 0
+		}
+		ans = (ans + cnt) % mod
+	}
+	return
+}
+```
 
+### **TypeScript**
+
+```ts
+function numSub(s: string): number {
+    const mod = 10 ** 9 + 7;
+    let ans = 0;
+    let cnt = 0;
+    for (const c of s) {
+        cnt = c == '1' ? cnt + 1 : 0;
+        ans = (ans + cnt) % mod;
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/1500-1599/1513.Number of Substrings With Only 1s/README_EN.md

@@ -48,13 +48,82 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def numSub(self, s: str) -> int:
+        ans = cnt = 0
+        for c in s:
+            if c == "1":
+                cnt += 1
+            else:
+                cnt = 0
+            ans += cnt
+        return ans % (10**9 + 7)
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int numSub(String s) {
+        final int mod = (int) 1e9 + 7;
+        int ans = 0, cnt = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            cnt = s.charAt(i) == '1' ? cnt + 1 : 0;
+            ans = (ans + cnt) % mod;
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numSub(string s) {
+        int ans = 0, cnt = 0;
+        const int mod = 1e9 + 7;
+        for (char& c : s) {
+            cnt = c == '1' ? cnt + 1 : 0;
+            ans = (ans + cnt) % mod;
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func numSub(s string) (ans int) {
+	const mod = 1e9 + 7
+	cnt := 0
+	for _, c := range s {
+		if c == '1' {
+			cnt++
+		} else {
+			cnt = 0
+		}
+		ans = (ans + cnt) % mod
+	}
+	return
+}
+```
 
+### **TypeScript**
+
+```ts
+function numSub(s: string): number {
+    const mod = 10 ** 9 + 7;
+    let ans = 0;
+    let cnt = 0;
+    for (const c of s) {
+        cnt = c == '1' ? cnt + 1 : 0;
+        ans = (ans + cnt) % mod;
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/1500-1599/1513.Number of Substrings With Only 1s/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int numSub(string s) {
+        int ans = 0, cnt = 0;
+        const int mod = 1e9 + 7;
+        for (char& c : s) {
+            cnt = c == '1' ? cnt + 1 : 0;
+            ans = (ans + cnt) % mod;
+        }
+        return ans;
+    }
+};

solution/1500-1599/1513.Number of Substrings With Only 1s/Solution.go

@@ -0,0 +1,13 @@
+func numSub(s string) (ans int) {
+	const mod = 1e9 + 7
+	cnt := 0
+	for _, c := range s {
+		if c == '1' {
+			cnt++
+		} else {
+			cnt = 0
+		}
+		ans = (ans + cnt) % mod
+	}
+	return
+}

solution/1500-1599/1513.Number of Substrings With Only 1s/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int numSub(String s) {
+        final int mod = (int) 1e9 + 7;
+        int ans = 0, cnt = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            cnt = s.charAt(i) == '1' ? cnt + 1 : 0;
+            ans = (ans + cnt) % mod;
+        }
+        return ans;
+    }
+}

solution/1500-1599/1513.Number of Substrings With Only 1s/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def numSub(self, s: str) -> int:
+        ans = cnt = 0
+        for c in s:
+            if c == "1":
+                cnt += 1
+            else:
+                cnt = 0
+            ans += cnt
+        return ans % (10**9 + 7)

solution/1500-1599/1513.Number of Substrings With Only 1s/Solution.ts

@@ -0,0 +1,10 @@
+function numSub(s: string): number {
+    const mod = 10 ** 9 + 7;
+    let ans = 0;
+    let cnt = 0;
+    for (const c of s) {
+        cnt = c == '1' ? cnt + 1 : 0;
+        ans = (ans + cnt) % mod;
+    }
+    return ans;
+}

solution/1500-1599/1514.Path with Maximum Probability/README.md

@@ -134,16 +134,15 @@ class Solution:
 class Solution {
     public double maxProbability(int n, int[][] edges, double[] succProb, int start, int end) {
         List<Pair<Integer, Double>>[] g = new List[n];
-        for (int i = 0; i < n; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int i = 0; i < edges.length; ++i) {
             int a = edges[i][0], b = edges[i][1];
             double s = succProb[i];
             g[a].add(new Pair<>(b, s));
             g[b].add(new Pair<>(a, s));
         }
-        PriorityQueue<Pair<Double, Integer>> q = new PriorityQueue<>(Comparator.comparingDouble(Pair::getKey));
+        PriorityQueue<Pair<Double, Integer>> q
+            = new PriorityQueue<>(Comparator.comparingDouble(Pair::getKey));
         double[] d = new double[n];
         d[start] = 1.0;
         q.offer(new Pair<>(-1.0, start));
@@ -170,9 +169,7 @@ class Solution {
 class Solution {
     public double maxProbability(int n, int[][] edges, double[] succProb, int start, int end) {
         List<Pair<Integer, Double>>[] g = new List[n];
-        for (int i = 0; i < n; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int i = 0; i < edges.length; ++i) {
             int a = edges[i][0], b = edges[i][1];
             double s = succProb[i];

solution/1500-1599/1514.Path with Maximum Probability/README_EN.md

@@ -119,16 +119,15 @@ class Solution:
 class Solution {
     public double maxProbability(int n, int[][] edges, double[] succProb, int start, int end) {
         List<Pair<Integer, Double>>[] g = new List[n];
-        for (int i = 0; i < n; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int i = 0; i < edges.length; ++i) {
             int a = edges[i][0], b = edges[i][1];
             double s = succProb[i];
             g[a].add(new Pair<>(b, s));
             g[b].add(new Pair<>(a, s));
         }
-        PriorityQueue<Pair<Double, Integer>> q = new PriorityQueue<>(Comparator.comparingDouble(Pair::getKey));
+        PriorityQueue<Pair<Double, Integer>> q
+            = new PriorityQueue<>(Comparator.comparingDouble(Pair::getKey));
         double[] d = new double[n];
         d[start] = 1.0;
         q.offer(new Pair<>(-1.0, start));
@@ -155,9 +154,7 @@ class Solution {
 class Solution {
     public double maxProbability(int n, int[][] edges, double[] succProb, int start, int end) {
         List<Pair<Integer, Double>>[] g = new List[n];
-        for (int i = 0; i < n; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int i = 0; i < edges.length; ++i) {
             int a = edges[i][0], b = edges[i][1];
             double s = succProb[i];

solution/1500-1599/1514.Path with Maximum Probability/Solution.java

@@ -1,9 +1,7 @@
 class Solution {
     public double maxProbability(int n, int[][] edges, double[] succProb, int start, int end) {
         List<Pair<Integer, Double>>[] g = new List[n];
-        for (int i = 0; i < n; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int i = 0; i < edges.length; ++i) {
             int a = edges[i][0], b = edges[i][1];
             double s = succProb[i];