Update 01. 0-1_Knapsack_Problem.py

leetcode-io · Feb 10, 2023 · b93a935 · b93a935
1 parent 6af3b3d
commit b93a935
Showing 1 changed file with 0 additions and 1 deletion.
diff --git a/02_Dynamic-Programming/01. 0-1 Knapsack/01. 0-1_Knapsack_Problem.py b/02_Dynamic-Programming/01. 0-1 Knapsack/01. 0-1_Knapsack_Problem.py
@@ -4,7 +4,6 @@
 # Memoization
 class Solution:
     def knapSack(self,W, wt, val, n):
-
         dp = [[-1]*(W+1) for _ in range(n+1)]
         def dfs(n, W):
             if W == 0 or n == 0: return 0