May 20, 2023 · Apr 29, 2023 · Apr 29, 2023 · May 20, 2023 · May 20, 2023 · May 20, 2023
diff --git a/problems/0416.分割等和子集.md b/problems/0416.分割等和子集.md
diff --git a/problems/1005.K次取反后最大化的数组和.md b/problems/1005.K次取反后最大化的数组和.md
diff --git a/problems/1047.删除字符串中的所有相邻重复项.md b/problems/1047.删除字符串中的所有相邻重复项.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -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
		}
		}
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -264,14 +264,15 @@ javaScript:

		```js
		var removeDuplicates = function(s) {
	const stack = [];
	for(const x of s) {
	let c = null;
	if(stack.length && x === (c = stack.pop())) continue;
	c && stack.push(c);
	stack.push(x);
	const result = []
	for(const i of s){
	if(i === result[result.length-1]){
	result.pop()
	}else{
	result.push(i)
	}
		}
	return stack.join("");
	return result.join('')
		};
		```

Expand Down