algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 12:15:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0416.分割等和子集.md about rust

Browse Source 
去除不必要的方法
This commit is contained in:
fwqaaq
2023-04-29 10:27:48 +08:00
committed by GitHub
parent f97940758e
commit 76d347076b
1 changed files with 10 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
problems/0416.分割等和子集.md
View File

@ -406,24 +406,21 @@ var canPartition = function(nums) {
```Rust ```Rust
impl Solution { impl Solution {
fn max(a: usize, b: usize) -> usize {
if a > b { a } else { b }
}
pub fn can_partition(nums: Vec<i32>) -> bool { pub fn can_partition(nums: Vec<i32>) -> bool {
let nums = nums.iter().map(|x| *x as usize).collect::<Vec<usize>>(); let sum = nums.iter().sum::<i32>() as usize;
let mut sum = 0; if sum % 2 == 1 {
let mut dp: Vec<usize> = vec![0; 10001]; return false;
for i in 0..nums.len() {
sum += nums[i];
} }
if sum % 2 == 1 { return false; }
let target = sum / 2; let target = sum / 2;
for i in 0..nums.len() { let mut dp = vec![0; target + 1];
for j in (nums[i]..=target).rev() { for n in nums {
dp[j] = Self::max(dp[j], dp[j - nums[i]] + nums[i]); 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 false
} }
} }