Merge pull request #589 from tejasvicsr1/feature/tjsv3

Solution to the problem 1512 #588

Author: vJechsmayr

LeetCode/1480_Running_Sum_of_1d_array.py

@@ -0,0 +1,8 @@
+class Solution:
+ def numIdenticalPairs(self, nums: List[int]) -> int:
+ ans = 0
+ for i in range(0, len(nums)):
+ for j in range(0, len(nums)):
+ if(nums[i] == nums[j] and i < j):
+ ans += 1
+ return ans