Skip to content

Added tasks 3572-3579 #1993

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 9 commits into from
Jun 10, 2025
Merged

Added tasks 3572-3579 #1993

Changes from 1 commit
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
e0edca5
Added tasks 3572-3579
javadev Jun 8, 2025
b70e36a
Fixed sonar
javadev Jun 8, 2025
6d059f0
Updated tags
javadev Jun 10, 2025
130c2ac
Fixed compile
javadev Jun 10, 2025
27334d3
Fixed compile
javadev Jun 10, 2025
87a36ef
Fixed style
javadev Jun 10, 2025
4f37b26
Fixed warning
javadev Jun 10, 2025
601e928
Fixed sonar
javadev Jun 10, 2025
76f6d9c
Added test
javadev Jun 10, 2025
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Fixed sonar
  • Loading branch information
@javadev
javadev committed Jun 10, 2025
commit 601e928d0eedf7f7bc97aab1c98e55ddec1e2621
2 changes: 0 additions & 2 deletions ...ava/g3501_3600/s3572_maximize_ysum_by_picking_a_triplet_of_distinct_xvalues/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,6 @@ public int maxSumDistinctTriplet(int[] x, int[] y) {
return -1;
}
int index2 = -1;
int index3 = -1;
max = -1;
for (int i = 0; i < y.length; i++) {
if (y[i] > max && x[i] != x[index]) {
Expand All @@ -35,7 +34,6 @@ public int maxSumDistinctTriplet(int[] x, int[] y) {
for (int i = 0; i < y.length; i++) {
if (y[i] > max && x[i] != x[index] && x[i] != x[index2]) {
max = y[i];
index3 = i;
}
}
if (max == -1) {
Expand Down