From 76d347076b1ff05769c6bbb8844027363608e017 Mon Sep 17 00:00:00 2001
From: fwqaaq <fwqaaq@gmail.com>
Date: Sat, 29 Apr 2023 10:27:48 +0800
Subject: [PATCH] =?UTF-8?q?Update=200416.=E5=88=86=E5=89=B2=E7=AD=89?=
 =?UTF-8?q?=E5=92=8C=E5=AD=90=E9=9B=86.md=20about=20rust?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

去除不必要的方法
---
 problems/0416.分割等和子集.md | 23 ++++++++++-------------
 1 file changed, 10 insertions(+), 13 deletions(-)

diff --git a/problems/0416.分割等和子集.md b/problems/0416.分割等和子集.md
index 8726bf95..8115e18e 100644
--- a/problems/0416.分割等和子集.md
+++ b/problems/0416.分割等和子集.md
@@ -406,24 +406,21 @@ var canPartition = function(nums) {
 
 ```Rust
 impl Solution {
-    fn max(a: usize, b: usize) -> usize {
-        if a > b { a } else { b }
-    }
     pub fn can_partition(nums: Vec<i32>) -> bool {
-        let nums = nums.iter().map(|x| *x as usize).collect::<Vec<usize>>();
-        let mut sum = 0;
-        let mut dp: Vec<usize> = vec![0; 10001];
-        for i in 0..nums.len() {
-            sum += nums[i];
+        let sum = nums.iter().sum::<i32>() as usize;
+        if sum % 2 == 1 {
+            return false;
         }
-        if sum % 2 == 1 { return false; }
         let target = sum / 2;
-        for i in 0..nums.len() {
-            for j in (nums[i]..=target).rev() {
-                dp[j] = Self::max(dp[j], dp[j - nums[i]] + nums[i]);
+        let mut dp = vec![0; target + 1];
+        for n in nums {
+            for j in (n as usize..=target).rev() {
+                dp[j] = dp[j].max(dp[j - n as usize] + n)
             }
         }
-        if dp[target] == target { return true; }
+        if dp[target] == target as i32 {
+            return true;
+        }
         false
     }
 }