Skip to content

Added tasks 2132, 2133, 2134, 2135, 2136 #1054

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 3 commits into from
Jun 4, 2022
Merged

Added tasks 2132, 2133, 2134, 2135, 2136 #1054

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
0e313ac
Added tasks 2132, 2133, 2134, 2135, 2136
ThanhNIT Jun 4, 2022
2cd1f05
format code
ThanhNIT Jun 4, 2022
0915b5e
fix smells
ThanhNIT Jun 4, 2022
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
fix smells
  • Loading branch information
@ThanhNIT
ThanhNIT committed Jun 4, 2022
commit 0915b5e753038257ed3bc7be2834e2a366beb1d0
3 changes: 2 additions & 1 deletion src/main/java/g2101_2200/s2134_minimum_swaps_to_group_all_1s_together_ii/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,8 @@ public int minSwaps(int[] nums) {

int ws = ones[l - 1];
int minSwaps = Integer.MAX_VALUE;
int si = 0, ei;
int si = 0;
int ei;

while (si < nums.length) {
ei = (si + ws - 1) % l;
Expand Down
4 changes: 0 additions & 4 deletions src/main/java/g2101_2200/s2135_count_words_obtained_after_adding_a_letter/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,10 +17,6 @@ private void preprocess(String[] words) {
}
}

private boolean matches(String word) {
return matches(getBitMap(word));
}

private boolean matches(int bitMap) {
return set.contains(bitMap);
}
Expand Down