Skip to content

Added tasks 2869-2873 #1634

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 10 commits into from
Dec 21, 2023
Merged

Added tasks 2869-2873 #1634

Changes from 1 commit
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
f37046a
Added tasks 2869-2873
ThanhNIT Dec 21, 2023
fb6c099
Update Solution.java
ThanhNIT Dec 21, 2023
7252261
Update Solution.java
ThanhNIT Dec 21, 2023
722e56d
Update Solution.java
ThanhNIT Dec 21, 2023
b0d98c0
Update Solution.java
ThanhNIT Dec 21, 2023
53d8b24
Update Solution.java
javadev Dec 21, 2023
578e787
Update Solution.java
javadev Dec 21, 2023
d0ac4b7
Update SolutionTest.java
javadev Dec 21, 2023
2b859e4
Update SolutionTest.java
javadev Dec 21, 2023
f39503f
Update SolutionTest.java
javadev Dec 21, 2023
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
Update Solution.java
  • Loading branch information
@javadev
javadev authored Dec 21, 2023
commit 578e787b9f8a21e07cbe762b52ba402597f43a2c
4 changes: 1 addition & 3 deletions src/main/java/g2801_2900/s2869_minimum_operations_to_collect_elements/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,9 +17,7 @@ public int minOperations(List<Integer> nums, int k) {
}
int fin = -1;
for (Pair pair : visited) {
if (pair != null && !pair.isVisited) {
return -1;
} else if (pair != null) {
if (pair != null) {
fin = Math.max(fin, pair.totalVisitedTillNow);
}
}
Expand Down