feat: add solutions to leetcode problem: No.0494, No.740

Author: maolonglong

solution/0400-0499/0494.Target Sum/README.md

@@ -49,7 +49,20 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findTargetSumWays(self, nums: List[int], target: int) -> int:
+        if target < -1000 or target > 1000:
+            return 0
+        n = len(nums)
+        dp = [[0] * 2001 for i in range(n)]
+        dp[0][nums[0] + 1000] += 1
+        dp[0][-nums[0] + 1000] += 1
+        for i in range(1, n):
+            for j in range(-1000, 1001):
+                if dp[i - 1][j + 1000] > 0:
+                    dp[i][j + nums[i] + 1000] += dp[i - 1][j + 1000]
+                    dp[i][j - nums[i] + 1000] += dp[i - 1][j + 1000]
+        return dp[n - 1][target + 1000]
 ```
 
 ### **Java**
@@ -66,7 +79,7 @@ class Solution {
         int n = nums.length;
         int[][] dp = new int[n][2001];
 
-        dp[0][nums[0] + 1000] = 1;
+        dp[0][nums[0] + 1000] += 1;
         dp[0][-nums[0] + 1000] += 1;
 
         for (int i = 1; i < n; i++) {

solution/0400-0499/0494.Target Sum/README_EN.md

@@ -55,7 +55,20 @@ It is similar to the backpack problem, except that the index may appear negative
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findTargetSumWays(self, nums: List[int], target: int) -> int:
+        if target < -1000 or target > 1000:
+            return 0
+        n = len(nums)
+        dp = [[0] * 2001 for i in range(n)]
+        dp[0][nums[0] + 1000] += 1
+        dp[0][-nums[0] + 1000] += 1
+        for i in range(1, n):
+            for j in range(-1000, 1001):
+                if dp[i - 1][j + 1000] > 0:
+                    dp[i][j + nums[i] + 1000] += dp[i - 1][j + 1000]
+                    dp[i][j - nums[i] + 1000] += dp[i - 1][j + 1000]
+        return dp[n - 1][target + 1000]
 ```
 
 ### **Java**
@@ -70,7 +83,7 @@ class Solution {
         int n = nums.length;
         int[][] dp = new int[n][2001];
 
-        dp[0][nums[0] + 1000] = 1;
+        dp[0][nums[0] + 1000] += 1;
         dp[0][-nums[0] + 1000] += 1;
 
         for (int i = 1; i < n; i++) {

solution/0400-0499/0494.Target Sum/Solution.java

@@ -7,7 +7,7 @@ public int findTargetSumWays(int[] nums, int target) {
         int n = nums.length;
         int[][] dp = new int[n][2001];
 
-        dp[0][nums[0] + 1000] = 1;
+        dp[0][nums[0] + 1000] += 1;
         dp[0][-nums[0] + 1000] += 1;
 
         for (int i = 1; i < n; i++) {

solution/0400-0499/0494.Target Sum/Solution.py

@@ -0,0 +1,14 @@
+class Solution:
+    def findTargetSumWays(self, nums: List[int], target: int) -> int:
+        if target < -1000 or target > 1000:
+            return 0
+        n = len(nums)
+        dp = [[0] * 2001 for i in range(n)]
+        dp[0][nums[0] + 1000] += 1
+        dp[0][-nums[0] + 1000] += 1
+        for i in range(1, n):
+            for j in range(-1000, 1001):
+                if dp[i - 1][j + 1000] > 0:
+                    dp[i][j + nums[i] + 1000] += dp[i - 1][j + 1000]
+                    dp[i][j - nums[i] + 1000] += dp[i - 1][j + 1000]
+        return dp[n - 1][target + 1000]

solution/0700-0799/0740.Delete and Earn/README.md

@@ -17,7 +17,7 @@
 <pre>
 <strong>输入:</strong> nums = [3, 4, 2]
 <strong>输出:</strong> 6
-<strong>解释:</strong> 
+<strong>解释:</strong>
 删除 4 来获得 4 个点数，因此 3 也被删除。
 之后，删除 2 来获得 2 个点数。总共获得 6 个点数。
 </pre>
@@ -27,7 +27,7 @@
 <pre>
 <strong>输入:</strong> nums = [2, 2, 3, 3, 3, 4]
 <strong>输出:</strong> 9
-<strong>解释:</strong> 
+<strong>解释:</strong>
 删除 3 来获得 3 个点数，接着要删除两个 2 和 4 。
 之后，再次删除 3 获得 3 个点数，再次删除 3 获得 3 个点数。
 总共获得 9 个点数。
@@ -70,7 +70,21 @@ nonSelect[i] = Math.max(select[i-1], nonSelect[i-1]);
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def deleteAndEarn(self, nums: List[int]) -> int:
+        mx = float('-inf')
+        for num in nums:
+            mx = max(mx, num)
+        total = [0] * (mx + 1)
+        for num in nums:
+            total[num] += num
+        first = total[0]
+        second = max(total[0], total[1])
+        for i in range(2, mx + 1):
+            cur = max(first + total[i], second)
+            first = second
+            second = cur
+        return second
 ```
 
 ### **Java**
@@ -103,6 +117,37 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func deleteAndEarn(nums []int) int {
+
+	max := func(x, y int) int {
+		if x > y {
+			return x
+		}
+		return y
+	}
+
+	mx := math.MinInt32
+	for _, num := range nums {
+		mx = max(mx, num)
+	}
+	total := make([]int, mx+1)
+	for _, num := range nums {
+		total[num] += num
+	}
+	first := total[0]
+	second := max(total[0], total[1])
+	for i := 2; i <= mx; i++ {
+		cur := max(first+total[i], second)
+		first = second
+		second = cur
+	}
+	return second
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0740.Delete and Earn/README_EN.md

@@ -65,7 +65,21 @@ nonSelect[i] = Math.max(select[i-1], nonSelect[i-1]);
 ### **Python3**
 
 ```python
-
+class Solution:
+    def deleteAndEarn(self, nums: List[int]) -> int:
+        mx = float('-inf')
+        for num in nums:
+            mx = max(mx, num)
+        total = [0] * (mx + 1)
+        for num in nums:
+            total[num] += num
+        first = total[0]
+        second = max(total[0], total[1])
+        for i in range(2, mx + 1):
+            cur = max(first + total[i], second)
+            first = second
+            second = cur
+        return second
 ```
 
 ### **Java**
@@ -96,6 +110,37 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func deleteAndEarn(nums []int) int {
+
+	max := func(x, y int) int {
+		if x > y {
+			return x
+		}
+		return y
+	}
+
+	mx := math.MinInt32
+	for _, num := range nums {
+		mx = max(mx, num)
+	}
+	total := make([]int, mx+1)
+	for _, num := range nums {
+		total[num] += num
+	}
+	first := total[0]
+	second := max(total[0], total[1])
+	for i := 2; i <= mx; i++ {
+		cur := max(first+total[i], second)
+		first = second
+		second = cur
+	}
+	return second
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0740.Delete and Earn/Solution.go

@@ -0,0 +1,26 @@
+func deleteAndEarn(nums []int) int {
+
+	max := func(x, y int) int {
+		if x > y {
+			return x
+		}
+		return y
+	}
+
+	mx := math.MinInt32
+	for _, num := range nums {
+		mx = max(mx, num)
+	}
+	total := make([]int, mx+1)
+	for _, num := range nums {
+		total[num] += num
+	}
+	first := total[0]
+	second := max(total[0], total[1])
+	for i := 2; i <= mx; i++ {
+		cur := max(first+total[i], second)
+		first = second
+		second = cur
+	}
+	return second
+}

solution/0700-0799/0740.Delete and Earn/Solution.py

@@ -0,0 +1,15 @@
+class Solution:
+    def deleteAndEarn(self, nums: List[int]) -> int:
+        mx = float('-inf')
+        for num in nums:
+            mx = max(mx, num)
+        total = [0] * (mx + 1)
+        for num in nums:
+            total[num] += num
+        first = total[0]
+        second = max(total[0], total[1])
+        for i in range(2, mx + 1):
+            cur = max(first + total[i], second)
+            first = second
+            second = cur
+        return second