Skip to content

Added tasks 1937, 1938, 1941, 1942, 1943 #889

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 2 commits into from
May 16, 2022
Merged

Added tasks 1937, 1938, 1941, 1942, 1943 #889

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
5c9e2e0
Added tasks 1937, 1938, 1941, 1942, 1943
ThanhNIT May 16, 2022
b645661
fix smells
ThanhNIT May 16, 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 May 16, 2022
commit b6456614d86483d7a6039c9b556b3a6800b02830
3 changes: 2 additions & 1 deletion src/main/java/g1901_2000/s1938_maximum_genetic_difference_query/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,8 @@ public int[] maxGeneticDifference(int[] parents, int[][] queries) {
}
int[] ret = new int[queries.length];
for (int q = 0; q < queries.length; q++) {
int cur = queries[q][0], value = queries[q][1];
int cur = queries[q][0];
int value = queries[q][1];
for (int p = 30; p >= 0; p--) {
int msk = 1 << p;
if ((value & msk) != (cur & msk)) {
Expand Down
3 changes: 2 additions & 1 deletion src/main/java/g1901_2000/s1943_describe_the_painting/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,8 @@ public List<List<Long>> splitPainting(int[][] segments) {
}

long mixedColor = 0;
for (int end = 1, start = 1; end < n; end++) {
int start = 1;
for (int end = 1; end < n; end++) {
if (endpoint[end]) {
if (mixedColor > 0) {
result.add(Arrays.asList((long) start, (long) end, mixedColor));
Expand Down