feat: add python solution to lc problem: No.2031 (#2131)

No.2031.Count Subarrays With More Ones Than Zeros

Author: yanglbme

solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README.md

@@ -101,13 +101,30 @@ class Solution:
         mod = 10**9 + 7
         ans = s = 0
         for x in nums:
-            s += 1 if x else -1
+            s += x or -1
             ans += tree.query(s - 1 + base)
             ans %= mod
             tree.update(s + base, 1)
         return ans
 ```
 
+```python
+from sortedcontainers import SortedList
+
+
+class Solution:
+    def subarraysWithMoreZerosThanOnes(self, nums: List[int]) -> int:
+        sl = SortedList([0])
+        mod = 10**9 + 7
+        ans = s = 0
+        for x in nums:
+            s += x or -1
+            ans += sl.bisect_left(s)
+            ans %= mod
+            sl.add(s)
+        return ans
+```
+
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
@@ -286,7 +303,7 @@ function subarraysWithMoreZerosThanOnes(nums: number[]): number {
     let ans: number = 0;
     let s: number = 0;
     for (const x of nums) {
-        s += x === 0 ? -1 : 1;
+        s += x || -1;
         ans += tree.query(s - 1 + base);
         ans %= mod;
         tree.update(s + base, 1);

solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README_EN.md

@@ -96,13 +96,30 @@ class Solution:
         mod = 10**9 + 7
         ans = s = 0
         for x in nums:
-            s += 1 if x else -1
+            s += x or -1
             ans += tree.query(s - 1 + base)
             ans %= mod
             tree.update(s + base, 1)
         return ans
 ```
 
+```python
+from sortedcontainers import SortedList
+
+
+class Solution:
+    def subarraysWithMoreZerosThanOnes(self, nums: List[int]) -> int:
+        sl = SortedList([0])
+        mod = 10**9 + 7
+        ans = s = 0
+        for x in nums:
+            s += x or -1
+            ans += sl.bisect_left(s)
+            ans %= mod
+            sl.add(s)
+        return ans
+```
+
 ### **Java**
 
 ```java
@@ -279,7 +296,7 @@ function subarraysWithMoreZerosThanOnes(nums: number[]): number {
     let ans: number = 0;
     let s: number = 0;
     for (const x of nums) {
-        s += x === 0 ? -1 : 1;
+        s += x || -1;
         ans += tree.query(s - 1 + base);
         ans %= mod;
         tree.update(s + base, 1);

solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/Solution.py

@@ -27,7 +27,7 @@ def subarraysWithMoreZerosThanOnes(self, nums: List[int]) -> int:
         mod = 10**9 + 7
         ans = s = 0
         for x in nums:
-            s += 1 if x else -1
+            s += x or -1
             ans += tree.query(s - 1 + base)
             ans %= mod
             tree.update(s + base, 1)

solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/Solution.ts

@@ -31,7 +31,7 @@ function subarraysWithMoreZerosThanOnes(nums: number[]): number {
     let ans: number = 0;
     let s: number = 0;
     for (const x of nums) {
-        s += x === 0 ? -1 : 1;
+        s += x || -1;
         ans += tree.query(s - 1 + base);
         ans %= mod;
         tree.update(s + base, 1);