Added leetcode

Author: das-jishu

Leetcode/remove-duplicates-from-sorted-array.py

@@ -0,0 +1,35 @@
+""" 
+Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length.
+
+Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
+
+Example 1:
+
+Given nums = [1,1,2],
+
+Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
+
+It doesn't matter what you leave beyond the returned length.
+Example 2:
+
+Given nums = [0,0,1,1,1,2,2,3,3,4],
+
+Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
+
+It doesn't matter what values are set beyond the returned length.
+Clarification:
+
+Confused why the returned value is an integer but your answer is an array?
+
+Note that the input array is passed in by reference, which means a modification to the input array will be known to the caller as well. """
+
+def removeDuplicates(self, nums) -> int:
+        if len(nums) == 1:
+            return 1
+        i = 1
+        while i < len(nums):
+            if nums[i] == nums[i - 1]:
+                del nums[i]
+                continue
+            i += 1
+        return len(nums)

Recursion/coin-change.py

@@ -5,6 +5,10 @@ def rec(target, coins, known):
         known[target] = 1
         return 1
 
+    # condition if there isn't a way to make the desired target
+    elif target < min(coins):
+        return 0
+
     elif known[target] > 0:
         return known[target]
 
@@ -14,10 +18,15 @@ def rec(target, coins, known):
             if num < min_coins:
                 min_coins = num
                 known[target] = min_coins
+
+    # condition if there isn't a way to make the desired target
+    if min_coins == 1:              
+        if target not in coins:
+            return 0
     return min_coins
 
 if __name__ == "__main__":
     target = 12
-    coins = [1, 4, 8, 10]
+    coins = [4, 7, 10]
     known = [0] * (target + 1)
     print(rec(target, coins, known))

test.py

@@ -17,4 +17,4 @@ def mincoins(target, coins, known):
     return res
 
 if __name__ == "__main__":
-    print(mincoins(10, [1, 3, 7, 8], [None]*11))
+    print(mincoins(10, [5, 3], [None]*11))