returning

Author: aluferraz

leetcode/editor/en/Q2364/CountNumberOfBadPairs.py

@@ -0,0 +1,31 @@
+import collections
+from typing import List
+
+
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def countBadPairs(self, nums: List[int]) -> int:
+        N = len(nums)
+        seen = collections.defaultdict(set)
+        good_pairs = 0
+
+        def sum_natural_numbers(n):
+            return n * (n + 1) // 2
+
+        total_pairs = sum_natural_numbers(N - 1)
+        for j in range(N):
+            target = j
+            if (nums[j] - target) in seen:
+                new_target = j - (nums[j] - target)
+                if new_target in seen[(nums[j] - target)]:
+                    good_pairs += 1
+            seen[nums[j]].add(j)
+
+        return total_pairs - good_pairs
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class CountNumberOfBadPairs(Solution):
+    pass

main.py

@@ -1,4 +1,4 @@
-from leetcode.editor.en.Q1462.CourseScheduleIv import CourseScheduleIv
+from leetcode.editor.en.Q2364.CountNumberOfBadPairs import CountNumberOfBadPairs
 
 if __name__ == '__main__':
-    print(CourseScheduleIv().checkIfPrerequisite(numCourses=2, prerequisites=[[1, 0]], queries=[[0, 1], [1, 0]]))
+    print(CountNumberOfBadPairs().countBadPairs([0, 1, 2, 3, 4]))