Update CoinChangeDP.py

Author: gupta-niharika

Dynamic Programming/CoinChangeDP/CoinChangeDP.py

@@ -13,7 +13,7 @@ def count(S, m, n ):
 	# If n is less than 0 then no
 	# solution exists
 	if (n < 0):
-		return 0;
+		return 0
 
 	# If there are no coins and n
 	# is greater than 0, then no
@@ -23,7 +23,7 @@ def count(S, m, n ):
 
 	# count is sum of solutions (i)
 	# including S[m-1] (ii) excluding S[m-1]
-	return count( S, m - 1, n ) + count( S, m, n-S[m-1] );
+	return count( S, m - 1, n ) + count( S, m, n-S[m-1] )
 
 # Driver program to test above function
 arr = [1, 2, 3]