Skip to content

Added tasks 2101, 2102, 2103, 2104, 2105 #1011

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 31, 2022
Merged

Added tasks 2101, 2102, 2103, 2104, 2105 #1011

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
ace4d24
Added tasks 2101, 2102, 2103, 2104, 2105
ThanhNIT May 31, 2022
18e4530
fix smells
ThanhNIT May 31, 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 31, 2022
commit 18e4530ac72c51e854b9180212e8d8ff6aa9cff7
11 changes: 7 additions & 4 deletions src/main/java/g2101_2200/s2101_detonate_the_maximum_bombs/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,12 +11,15 @@ public class Solution {
public int maximumDetonation(int[][] bombs) {
int n = bombs.length;
List<Integer>[] graph = new List[n];
for (int i = 0; i < n; i++) graph[i] = new ArrayList<>();
for (int i = 0; i < n; i++) {
graph[i] = new ArrayList<>();
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
double dx = bombs[i][0] - bombs[j][0];
double dy = bombs[i][1] - bombs[j][1];
double r1 = bombs[i][2], r2 = bombs[j][2];
double dx = bombs[i][0] - (double) bombs[j][0];
double dy = bombs[i][1] - (double) bombs[j][1];
double r1 = bombs[i][2];
double r2 = bombs[j][2];
double dist = dx * dx + dy * dy;
if (dist <= r1 * r1) {
graph[i].add(j);
Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@ public int getScore() {

public SORTracker() {
tSet1 =
new TreeSet<Location>(
new TreeSet<>(
(a, b) -> {
if (a.score != b.score) {
return b.getScore() - a.getScore();
Expand All @@ -39,7 +39,7 @@ public SORTracker() {
});

tSet2 =
new TreeSet<Location>(
new TreeSet<>(
(a, b) -> {
if (a.score != b.score) {
return b.getScore() - a.getScore();
Expand Down