Skip to content

Create 3068. Find the Maximum Sum of Node Values1 #802

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 23, 2025
Merged

Create 3068. Find the Maximum Sum of Node Values1 #802

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions 3068. Find the Maximum Sum of Node Values1
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
class Solution {
public:
long long maximumValueSum(vector<int>& nums, int k, vector<vector<int>>& edges) {
long long ans = 0;
int minLoss = INT_MAX;
int canInc = 0;

for(int i = 0; i < nums.size(); i++){
if(nums[i] > (nums[i]^k)) ans += nums[i];
else {
ans += nums[i]^k;
canInc++;
}
minLoss = min(minLoss,abs(nums[i]-(nums[i]^k)));
}
if(canInc % 2 == 0) return ans;
return ans-minLoss;
}
};
Loading