From 7d02f0f0bd62cb0a06dbcc2de1b818652c81e283 Mon Sep 17 00:00:00 2001 From: ThanhNIT Date: Tue, 8 Sep 2026 21:05:51 +0700 Subject: [PATCH 1/3] fix sonars --- .../s0295_find_median_from_data_stream/MedianFinder.java | 2 +- .../s0347_top_k_frequent_elements/Solution.java | 2 +- .../g0401_0500/s0407_trapping_rain_water_ii/Solution.java | 2 +- src/main/java/g0501_0600/s0502_ipo/Solution.java | 2 +- .../g0601_0700/s0630_course_schedule_iii/Solution.java | 4 ++-- .../Solution.java | 2 +- .../s0646_maximum_length_of_pair_chain/Solution.java | 2 +- .../g0601_0700/s0692_top_k_frequent_words/Solution.java | 2 +- .../java/g0701_0800/s0729_my_calendar_i/MyCalendar.java | 2 +- .../g0701_0800/s0736_parse_lisp_expression/Solution.java | 1 + .../s0871_minimum_number_of_refueling_stops/Solution.java | 2 +- .../g1001_1100/s1029_two_city_scheduling/Solution.java | 2 +- .../java/g1001_1100/s1046_last_stone_weight/Solution.java | 2 +- .../g1301_1400/s1366_rank_teams_by_votes/Solution.java | 2 +- .../s1383_maximum_performance_of_a_team/Solution.java | 2 +- .../Solution.java | 4 ++-- .../Solution.java | 7 +++---- .../Solution.java | 2 +- .../s1584_min_cost_to_connect_all_points/Solution.java | 2 +- .../s1631_path_with_minimum_effort/Solution.java | 2 +- .../s1675_minimize_deviation_in_array/Solution.java | 2 +- .../java/g1601_1700/s1686_stone_game_vi/Solution.java | 2 +- .../Solution.java | 6 +++--- .../s1705_maximum_number_of_eaten_apples/Solution.java | 2 +- .../Solution.java | 2 +- .../s1801_number_of_orders_in_the_backlog/Solution.java | 2 +- .../g1801_1900/s1834_single_threaded_cpu/Solution.java | 4 ++-- .../s1882_process_tasks_using_servers/Solution.java | 2 +- .../Solution.java | 2 +- .../s2054_two_best_non_overlapping_events/Solution.java | 2 +- .../s2092_find_all_people_with_secret/Solution.java | 2 +- .../Solution.java | 2 +- .../SORTracker.java | 4 ++-- .../Solution.java | 2 +- .../Solution.java | 4 ++-- .../Solution.java | 2 +- .../s2191_sort_the_jumbled_numbers/Solution.java | 2 +- .../Solution.java | 2 +- .../Solution.java | 2 +- .../s2542_maximum_subsequence_score/Solution.java | 4 ++-- .../Solution.java | 2 +- .../s2558_take_gifts_from_the_richest_pile/Solution.java | 2 +- .../Graph.java | 2 +- .../g2701_2800/s2736_maximum_sum_queries/Solution.java | 2 +- .../s2747_count_zero_request_servers/Solution.java | 4 ++-- .../Solution.java | 2 +- .../Solution.java | 2 +- .../Solution.java | 2 +- .../Solution.java | 6 +++--- .../Solution.java | 2 +- .../s3193_count_the_number_of_inversions/Solution.java | 2 +- .../Solution.java | 2 +- .../Solution.java | 2 +- .../Solution.java | 8 ++++---- .../Solution.java | 4 ++-- .../Solution.java | 4 ++-- .../Solution.java | 2 +- .../s3362_zero_array_transformation_iii/Solution.java | 4 ++-- .../Solution.java | 2 +- .../Solution.java | 2 +- .../Solution.java | 2 +- .../Solution.java | 4 ++-- .../Solution.java | 2 +- 63 files changed, 83 insertions(+), 83 deletions(-) diff --git a/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java b/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java index 0f0ebfaa6..da02f9501 100644 --- a/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java +++ b/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java @@ -15,7 +15,7 @@ public class MedianFinder { // initialize your data structure here. public MedianFinder() { - maxHeap = new PriorityQueue<>((a, b) -> (b - a)); + maxHeap = new PriorityQueue<>((a, b) -> (Integer.compare(b, a))); minHeap = new PriorityQueue<>(); } diff --git a/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java b/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java index f6d69f07d..502f63745 100644 --- a/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java +++ b/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java @@ -12,7 +12,7 @@ public class Solution { public int[] topKFrequent(int[] nums, int k) { Arrays.sort(nums); // Min heap of - Queue queue = new PriorityQueue<>(k + 1, (a, b) -> (a[1] - b[1])); + Queue queue = new PriorityQueue<>(k + 1, (a, b) -> (Integer.compare(a[1], b[1]))); // Filter with min heap int j = 0; for (int i = 0; i <= nums.length; i++) { diff --git a/src/main/java/g0401_0500/s0407_trapping_rain_water_ii/Solution.java b/src/main/java/g0401_0500/s0407_trapping_rain_water_ii/Solution.java index 2aa2297b4..993198de0 100644 --- a/src/main/java/g0401_0500/s0407_trapping_rain_water_ii/Solution.java +++ b/src/main/java/g0401_0500/s0407_trapping_rain_water_ii/Solution.java @@ -20,7 +20,7 @@ public Cell(int r, int c, int v) { @Override public int compareTo(Cell other) { - return value - other.value; + return Integer.compare(value, other.value); } @Override diff --git a/src/main/java/g0501_0600/s0502_ipo/Solution.java b/src/main/java/g0501_0600/s0502_ipo/Solution.java index 8c901247c..62d57928b 100644 --- a/src/main/java/g0501_0600/s0502_ipo/Solution.java +++ b/src/main/java/g0501_0600/s0502_ipo/Solution.java @@ -10,7 +10,7 @@ public class Solution { public int findMaximizedCapital(int k, int w, int[] profits, int[] capital) { PriorityQueue minCapital = new PriorityQueue<>(Comparator.comparingInt((int[] a) -> a[1])); - PriorityQueue maxProfit = new PriorityQueue<>((int[] a, int[] b) -> b[0] - a[0]); + PriorityQueue maxProfit = new PriorityQueue<>((int[] a, int[] b) -> Integer.compare(b[0], a[0])); for (int i = 0; i < profits.length; i++) { if (w >= capital[i]) { maxProfit.offer(new int[] {profits[i], capital[i]}); diff --git a/src/main/java/g0601_0700/s0630_course_schedule_iii/Solution.java b/src/main/java/g0601_0700/s0630_course_schedule_iii/Solution.java index a3c3b8804..d7771195d 100644 --- a/src/main/java/g0601_0700/s0630_course_schedule_iii/Solution.java +++ b/src/main/java/g0601_0700/s0630_course_schedule_iii/Solution.java @@ -9,13 +9,13 @@ public class Solution { public int scheduleCourse(int[][] courses) { // Sort the courses based on their deadline date. - Arrays.sort(courses, (a, b) -> a[1] - b[1]); + Arrays.sort(courses, (a, b) -> Integer.compare(a[1], b[1])); // Only the duration is stored. We don't care which course // is the longest, we only care about the total courses can // be taken. // If the question wants the course ids to be returned. // Consider use a Pair int pair. - PriorityQueue pq = new PriorityQueue<>((a, b) -> b - a); + PriorityQueue pq = new PriorityQueue<>((a, b) -> Integer.compare(b, a)); // Total time consumed. int time = 0; // At the given time `course`, the overall "time limit" is diff --git a/src/main/java/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/Solution.java b/src/main/java/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/Solution.java index f6b05df36..a5fe4c9b6 100644 --- a/src/main/java/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/Solution.java +++ b/src/main/java/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/Solution.java @@ -21,7 +21,7 @@ static class Triplet implements Comparable { } public int compareTo(Triplet obj) { - return this.value - obj.value; + return Integer.compare(this.value, obj.value); } } diff --git a/src/main/java/g0601_0700/s0646_maximum_length_of_pair_chain/Solution.java b/src/main/java/g0601_0700/s0646_maximum_length_of_pair_chain/Solution.java index ad5441a1b..bc5800e44 100644 --- a/src/main/java/g0601_0700/s0646_maximum_length_of_pair_chain/Solution.java +++ b/src/main/java/g0601_0700/s0646_maximum_length_of_pair_chain/Solution.java @@ -10,7 +10,7 @@ public int findLongestChain(int[][] pairs) { if (pairs.length == 1) { return 1; } - Arrays.sort(pairs, (a, b) -> a[1] - b[1]); + Arrays.sort(pairs, (a, b) -> Integer.compare(a[1], b[1])); int min = pairs[0][1]; int max = 1; for (int i = 1; i < pairs.length; i++) { diff --git a/src/main/java/g0601_0700/s0692_top_k_frequent_words/Solution.java b/src/main/java/g0601_0700/s0692_top_k_frequent_words/Solution.java index dcda3e780..f460d56c1 100644 --- a/src/main/java/g0601_0700/s0692_top_k_frequent_words/Solution.java +++ b/src/main/java/g0601_0700/s0692_top_k_frequent_words/Solution.java @@ -25,7 +25,7 @@ public List topKFrequent(String[] words, int k) { new TreeSet<>( (e1, e2) -> { if (e1.getValue().intValue() != e2.getValue().intValue()) { - return e2.getValue() - e1.getValue(); + return Integer.compare(e2.getValue(), e1.getValue()); } else { return e1.getKey().compareToIgnoreCase(e2.getKey()); } diff --git a/src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java b/src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java index b75ba8716..e34da9cdb 100644 --- a/src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java +++ b/src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java @@ -18,7 +18,7 @@ public Meeting(int start, int end) { @Override public int compareTo(Meeting anotherMeeting) { - return this.start - anotherMeeting.start; + return Integer.compare(this.start, anotherMeeting.start); } } diff --git a/src/main/java/g0701_0800/s0736_parse_lisp_expression/Solution.java b/src/main/java/g0701_0800/s0736_parse_lisp_expression/Solution.java index b4a06bb6d..762123792 100644 --- a/src/main/java/g0701_0800/s0736_parse_lisp_expression/Solution.java +++ b/src/main/java/g0701_0800/s0736_parse_lisp_expression/Solution.java @@ -15,6 +15,7 @@ static class Exp { public Exp(Exp from) { this.exps = new LinkedList<>(); + this.op = null; this.parent = from; } diff --git a/src/main/java/g0801_0900/s0871_minimum_number_of_refueling_stops/Solution.java b/src/main/java/g0801_0900/s0871_minimum_number_of_refueling_stops/Solution.java index 8cf64675e..459fddd3b 100644 --- a/src/main/java/g0801_0900/s0871_minimum_number_of_refueling_stops/Solution.java +++ b/src/main/java/g0801_0900/s0871_minimum_number_of_refueling_stops/Solution.java @@ -12,7 +12,7 @@ public int minRefuelStops(int target, int startFuel, int[][] stations) { } else if (stations == null || stations.length == 0) { return -1; } - PriorityQueue pq = new PriorityQueue<>((a, b) -> b[1] - a[1]); + PriorityQueue pq = new PriorityQueue<>((a, b) -> Integer.compare(b[1], a[1])); int start = 0; int end = stations.length; int currentFuel = startFuel; diff --git a/src/main/java/g1001_1100/s1029_two_city_scheduling/Solution.java b/src/main/java/g1001_1100/s1029_two_city_scheduling/Solution.java index e931dea43..589ed3f0c 100644 --- a/src/main/java/g1001_1100/s1029_two_city_scheduling/Solution.java +++ b/src/main/java/g1001_1100/s1029_two_city_scheduling/Solution.java @@ -6,7 +6,7 @@ public class Solution { public int twoCitySchedCost(int[][] costs) { - Arrays.sort(costs, (a, b) -> (a[0] - a[1] - (b[0] - b[1]))); + Arrays.sort(costs, (a, b) -> Long.compare((long) a[0] - a[1], (long) b[0] - b[1])); int cost = 0; for (int i = 0; i < costs.length; i++) { if (i < costs.length / 2) { diff --git a/src/main/java/g1001_1100/s1046_last_stone_weight/Solution.java b/src/main/java/g1001_1100/s1046_last_stone_weight/Solution.java index 049d923d6..a66a333e6 100644 --- a/src/main/java/g1001_1100/s1046_last_stone_weight/Solution.java +++ b/src/main/java/g1001_1100/s1046_last_stone_weight/Solution.java @@ -7,7 +7,7 @@ public class Solution { public int lastStoneWeight(int[] stones) { - PriorityQueue heap = new PriorityQueue<>((a, b) -> b - a); + PriorityQueue heap = new PriorityQueue<>((a, b) -> Integer.compare(b, a)); for (int stone : stones) { heap.offer(stone); } diff --git a/src/main/java/g1301_1400/s1366_rank_teams_by_votes/Solution.java b/src/main/java/g1301_1400/s1366_rank_teams_by_votes/Solution.java index 106674325..5b7d9c1be 100644 --- a/src/main/java/g1301_1400/s1366_rank_teams_by_votes/Solution.java +++ b/src/main/java/g1301_1400/s1366_rank_teams_by_votes/Solution.java @@ -30,7 +30,7 @@ public String rankTeams(String[] votes) { (o1, o2) -> { for (int i = 0; i < 26; i++) { if (o1.count[i] != o2.count[i]) { - return o2.count[i] - o1.count[i]; + return Integer.compare(o2.count[i], o1.count[i]); } } return o1.c - o2.c; diff --git a/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java b/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java index a770b875d..a34f97368 100644 --- a/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java +++ b/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java @@ -13,7 +13,7 @@ public int maxPerformance(int n, int[] speed, int[] efficiency, int k) { engineers[i][0] = speed[i]; engineers[i][1] = efficiency[i]; } - Arrays.sort(engineers, (engineer1, engineer2) -> engineer2[1] - engineer1[1]); + Arrays.sort(engineers, (engineer1, engineer2) -> Integer.compare(engineer2[1], engineer1[1])); long speedSum = 0; long maximumPerformance = 0; PriorityQueue minHeap = new PriorityQueue<>(); diff --git a/src/main/java/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.java b/src/main/java/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.java index e80e0faaa..bb98cb5df 100644 --- a/src/main/java/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.java +++ b/src/main/java/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.java @@ -13,11 +13,11 @@ public int kthSmallest(int[][] mat, int k) { new TreeSet<>( (o1, o2) -> { if (o1[0] != o2[0]) { - return o1[0] - o2[0]; + return Integer.compare(o1[0], o2[0]); } else { for (int i = 1; i < o1.length; i++) { if (o1[i] != o2[i]) { - return o1[i] - o2[i]; + return Integer.compare(o1[i], o2[i]); } } return 0; diff --git a/src/main/java/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.java b/src/main/java/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.java index bab66a122..37f9b895c 100644 --- a/src/main/java/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.java +++ b/src/main/java/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.java @@ -19,10 +19,9 @@ private static class Angle implements Comparable { @Override public int compareTo(Angle o) { - if (a > o.a) { - return 1; - } else if (a < o.a) { - return -1; + int angleComparison = Double.compare(a, o.a); + if (angleComparison != 0) { + return angleComparison; } else if (enter == o.enter) { return 0; } else if (enter) { diff --git a/src/main/java/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.java b/src/main/java/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.java index 9ebf09c06..c691ce89b 100644 --- a/src/main/java/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.java +++ b/src/main/java/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.java @@ -6,7 +6,7 @@ public class Solution { public int maxNumEdgesToRemove(int n, int[][] edges) { - Arrays.sort(edges, (a, b) -> (b[0] - a[0])); + Arrays.sort(edges, (a, b) -> (Integer.compare(b[0], a[0]))); int[] alice = new int[n + 1]; int[] rankAlice = new int[n + 1]; int[] bob = new int[n + 1]; diff --git a/src/main/java/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.java b/src/main/java/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.java index a066f07c8..10663eb4d 100644 --- a/src/main/java/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.java +++ b/src/main/java/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.java @@ -86,7 +86,7 @@ public int getV() { @Override public int compare(Pair p1, Pair p2) { - return p1.dis - p2.dis; + return Integer.compare(p1.dis, p2.dis); } } } diff --git a/src/main/java/g1601_1700/s1631_path_with_minimum_effort/Solution.java b/src/main/java/g1601_1700/s1631_path_with_minimum_effort/Solution.java index 0b52f2061..bfecbb293 100644 --- a/src/main/java/g1601_1700/s1631_path_with_minimum_effort/Solution.java +++ b/src/main/java/g1601_1700/s1631_path_with_minimum_effort/Solution.java @@ -19,7 +19,7 @@ private static class Pair implements Comparable { } public int compareTo(Pair o) { - return this.diff - o.diff; + return Integer.compare(this.diff, o.diff); } } diff --git a/src/main/java/g1601_1700/s1675_minimize_deviation_in_array/Solution.java b/src/main/java/g1601_1700/s1675_minimize_deviation_in_array/Solution.java index 46a8e78a2..f81e005ce 100644 --- a/src/main/java/g1601_1700/s1675_minimize_deviation_in_array/Solution.java +++ b/src/main/java/g1601_1700/s1675_minimize_deviation_in_array/Solution.java @@ -7,7 +7,7 @@ public class Solution { public int minimumDeviation(int[] nums) { - PriorityQueue pq = new PriorityQueue<>((a, b) -> b - a); + PriorityQueue pq = new PriorityQueue<>((a, b) -> Integer.compare(b, a)); int min = Integer.MAX_VALUE; for (int num : nums) { if (num % 2 == 1) { diff --git a/src/main/java/g1601_1700/s1686_stone_game_vi/Solution.java b/src/main/java/g1601_1700/s1686_stone_game_vi/Solution.java index 30beb131b..5a1a245f3 100644 --- a/src/main/java/g1601_1700/s1686_stone_game_vi/Solution.java +++ b/src/main/java/g1601_1700/s1686_stone_game_vi/Solution.java @@ -19,7 +19,7 @@ private static class Pair implements Comparable { } public int compareTo(Pair p) { - return p.sum - this.sum; + return Integer.compare(p.sum, this.sum); } } diff --git a/src/main/java/g1601_1700/s1691_maximum_height_by_stacking_cuboids/Solution.java b/src/main/java/g1601_1700/s1691_maximum_height_by_stacking_cuboids/Solution.java index d83546fde..0a943bf46 100644 --- a/src/main/java/g1601_1700/s1691_maximum_height_by_stacking_cuboids/Solution.java +++ b/src/main/java/g1601_1700/s1691_maximum_height_by_stacking_cuboids/Solution.java @@ -13,11 +13,11 @@ public int maxHeight(int[][] arr) { arr, (a, b) -> { if (a[0] != b[0]) { - return a[0] - b[0]; + return Integer.compare(a[0], b[0]); } else if (a[1] != b[1]) { - return a[1] - b[1]; + return Integer.compare(a[1], b[1]); } - return a[2] - b[2]; + return Integer.compare(a[2], b[2]); }); int ans = 0; int[] dp = new int[arr.length]; diff --git a/src/main/java/g1701_1800/s1705_maximum_number_of_eaten_apples/Solution.java b/src/main/java/g1701_1800/s1705_maximum_number_of_eaten_apples/Solution.java index 7d574f15a..2b4946baa 100644 --- a/src/main/java/g1701_1800/s1705_maximum_number_of_eaten_apples/Solution.java +++ b/src/main/java/g1701_1800/s1705_maximum_number_of_eaten_apples/Solution.java @@ -7,7 +7,7 @@ public class Solution { public int eatenApples(int[] apples, int[] days) { - PriorityQueue minHeap = new PriorityQueue<>((a, b) -> a[0] - b[0]); + PriorityQueue minHeap = new PriorityQueue<>((a, b) -> Integer.compare(a[0], b[0])); int eatenApples = 0; for (int i = 0; i < apples.length || !minHeap.isEmpty(); i++) { if (i < apples.length) { diff --git a/src/main/java/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/Solution.java b/src/main/java/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/Solution.java index 7e68fb9d8..8e62dd65f 100644 --- a/src/main/java/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/Solution.java +++ b/src/main/java/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/Solution.java @@ -19,7 +19,7 @@ private static class Pair implements Comparable { } public int compareTo(Pair o) { - return this.cwt - o.cwt; + return Integer.compare(this.cwt, o.cwt); } } diff --git a/src/main/java/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.java b/src/main/java/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.java index fc67f2e6b..72c724d06 100644 --- a/src/main/java/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.java +++ b/src/main/java/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.java @@ -19,7 +19,7 @@ private static class Order { public int getNumberOfBacklogOrders(int[][] orders) { PriorityQueue sell = new PriorityQueue<>(Comparator.comparingInt(a -> a.price)); - PriorityQueue buy = new PriorityQueue<>((a, b) -> b.price - a.price); + PriorityQueue buy = new PriorityQueue<>((a, b) -> Integer.compare(b.price, a.price)); for (int[] order : orders) { int price = order[0]; int amount = order[1]; diff --git a/src/main/java/g1801_1900/s1834_single_threaded_cpu/Solution.java b/src/main/java/g1801_1900/s1834_single_threaded_cpu/Solution.java index faf2a6b24..7b8918697 100644 --- a/src/main/java/g1801_1900/s1834_single_threaded_cpu/Solution.java +++ b/src/main/java/g1801_1900/s1834_single_threaded_cpu/Solution.java @@ -19,9 +19,9 @@ public int[] getOrder(int[][] tasks1) { new PriorityQueue<>( (a, b) -> { if (a[1] == b[1]) { - return a[2] - b[2]; + return Integer.compare(a[2], b[2]); } else { - return a[1] - b[1]; + return Integer.compare(a[1], b[1]); } }); int time = tasks[0][0]; diff --git a/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java b/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java index 66838b239..2076bdbbc 100644 --- a/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java +++ b/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java @@ -13,7 +13,7 @@ public int[] assignTasks(int[] servers, int[] tasks) { for (int i = 0; i < servers.length; i++) { serverq.offer(i); } - PriorityQueue activetaskq = new PriorityQueue<>((i1, i2) -> i1[1] - i2[1]); + PriorityQueue activetaskq = new PriorityQueue<>((i1, i2) -> Integer.compare(i1[1], i2[1])); int time = 0; int[] res = new int[tasks.length]; for (int i = 0; i < tasks.length; i++) { diff --git a/src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences/Solution.java b/src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences/Solution.java index 409b371ef..4b2f876d4 100644 --- a/src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences/Solution.java +++ b/src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences/Solution.java @@ -22,7 +22,7 @@ public int maxProduct(String s) { recur(chars, new State(i, i, 0, mask), list, visited); recur(chars, new State(i, i + 1, 0, mask), list, visited); } - list.sort((a, b) -> b.cnt - a.cnt); + list.sort((a, b) -> Integer.compare(b.cnt, a.cnt)); int res = 1; Set explored = new HashSet<>(); for (int i = 0; i < list.size() - 1; ++i) { diff --git a/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java b/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java index 016313511..7f635963d 100644 --- a/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java +++ b/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java @@ -7,7 +7,7 @@ public class Solution { public int maxTwoEvents(int[][] events) { - Arrays.sort(events, (a, b) -> a[0] - b[0]); + Arrays.sort(events, (a, b) -> Integer.compare(a[0], b[0])); int[] max = new int[events.length]; for (int i = events.length - 1; i >= 0; i--) { if (i == events.length - 1) { diff --git a/src/main/java/g2001_2100/s2092_find_all_people_with_secret/Solution.java b/src/main/java/g2001_2100/s2092_find_all_people_with_secret/Solution.java index 80243f4d9..c2e543d60 100644 --- a/src/main/java/g2001_2100/s2092_find_all_people_with_secret/Solution.java +++ b/src/main/java/g2001_2100/s2092_find_all_people_with_secret/Solution.java @@ -11,7 +11,7 @@ public class Solution { public List findAllPeople(int n, int[][] meetings, int firstPerson) { - Arrays.sort(meetings, ((a, b) -> a[2] - b[2])); + Arrays.sort(meetings, ((a, b) -> Integer.compare(a[2], b[2]))); UF uf = new UF(n); // base uf.union(0, firstPerson); diff --git a/src/main/java/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/Solution.java b/src/main/java/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/Solution.java index fc59a1897..64e934460 100644 --- a/src/main/java/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/Solution.java +++ b/src/main/java/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/Solution.java @@ -15,7 +15,7 @@ public int[] maxSubsequence(int[] nums, int k) { // Loop from 0 to n-1 and add element in result if set contains those index // For ex. set has index 3,5,6 Just add those element. Order will be maintained // We are defining the min priority queue - PriorityQueue q = new PriorityQueue<>((a, b) -> (a[0] - b[0])); + PriorityQueue q = new PriorityQueue<>((a, b) -> (Integer.compare(a[0], b[0]))); // Add element with index to priority queue for (int i = 0; i < nums.length; i++) { q.offer(new int[] {nums[i], i}); diff --git a/src/main/java/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.java b/src/main/java/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.java index ab8b0b30a..f5708c4dc 100644 --- a/src/main/java/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.java +++ b/src/main/java/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.java @@ -32,7 +32,7 @@ public SORTracker() { new TreeSet<>( (a, b) -> { if (a.score != b.score) { - return b.getScore() - a.getScore(); + return Integer.compare(b.getScore(), a.getScore()); } else { return a.getName().compareTo(b.getName()); } @@ -42,7 +42,7 @@ public SORTracker() { new TreeSet<>( (a, b) -> { if (a.score != b.score) { - return b.getScore() - a.getScore(); + return Integer.compare(b.getScore(), a.getScore()); } else { return a.getName().compareTo(b.getName()); } diff --git a/src/main/java/g2101_2200/s2136_earliest_possible_day_of_full_bloom/Solution.java b/src/main/java/g2101_2200/s2136_earliest_possible_day_of_full_bloom/Solution.java index 0501f64ae..6f7f421c4 100644 --- a/src/main/java/g2101_2200/s2136_earliest_possible_day_of_full_bloom/Solution.java +++ b/src/main/java/g2101_2200/s2136_earliest_possible_day_of_full_bloom/Solution.java @@ -37,7 +37,7 @@ static class Seed implements Comparable { } public int compareTo(Seed s) { - return this.growTime - s.growTime; + return Integer.compare(this.growTime, s.growTime); } } } diff --git a/src/main/java/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/Solution.java b/src/main/java/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/Solution.java index a48633bab..575611663 100644 --- a/src/main/java/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/Solution.java +++ b/src/main/java/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/Solution.java @@ -69,9 +69,9 @@ public List> highestRankedKItems( if (distDiff == 0) { int priceDiff = a.price - b.price; if (priceDiff == 0) { - int rowDiff = a.row - b.row; + int rowDiff = Integer.compare(a.row, b.row); if (rowDiff == 0) { - return a.col - b.col; + return Integer.compare(a.col, b.col); } return rowDiff; } diff --git a/src/main/java/g2101_2200/s2163_minimum_difference_in_sums_after_removal_of_elements/Solution.java b/src/main/java/g2101_2200/s2163_minimum_difference_in_sums_after_removal_of_elements/Solution.java index faa9a00c8..b84460aa4 100644 --- a/src/main/java/g2101_2200/s2163_minimum_difference_in_sums_after_removal_of_elements/Solution.java +++ b/src/main/java/g2101_2200/s2163_minimum_difference_in_sums_after_removal_of_elements/Solution.java @@ -9,7 +9,7 @@ public class Solution { public long minimumDifference(int[] nums) { int n = nums.length / 3; PriorityQueue minHeap = new PriorityQueue<>(); - PriorityQueue maxHeap = new PriorityQueue<>((a, b) -> b - a); + PriorityQueue maxHeap = new PriorityQueue<>((a, b) -> Integer.compare(b, a)); long[] leftMemo = new long[nums.length]; long[] rightMemo = new long[nums.length]; long current = 0L; diff --git a/src/main/java/g2101_2200/s2191_sort_the_jumbled_numbers/Solution.java b/src/main/java/g2101_2200/s2191_sort_the_jumbled_numbers/Solution.java index 3d5ab09e0..56d4c0b92 100644 --- a/src/main/java/g2101_2200/s2191_sort_the_jumbled_numbers/Solution.java +++ b/src/main/java/g2101_2200/s2191_sort_the_jumbled_numbers/Solution.java @@ -41,7 +41,7 @@ public int[] sortJumbled(int[] mapping, int[] nums) { if (retval != 0) { return retval; } - return a.index - b.index; + return Integer.compare(a.index, b.index); }); int[] retval = new int[nums.length]; for (int i = 0; i < nums.length; i++) { diff --git a/src/main/java/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/Solution.java b/src/main/java/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/Solution.java index bb08d835b..531cab07c 100644 --- a/src/main/java/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/Solution.java +++ b/src/main/java/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/Solution.java @@ -10,7 +10,7 @@ public int minimumLines(int[][] stockPrices) { if (stockPrices.length == 1) { return 0; } - Arrays.sort(stockPrices, (a, b) -> a[0] - b[0]); + Arrays.sort(stockPrices, (a, b) -> Integer.compare(a[0], b[0])); // multiply with 1.0 to make it double and multiply with 100 for making it big so that // difference won't come out to be very less and after division it become 0. // failing for one of the case without multiply 100 diff --git a/src/main/java/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/Solution.java b/src/main/java/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/Solution.java index 0990df52f..9267ffd4a 100644 --- a/src/main/java/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/Solution.java +++ b/src/main/java/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/Solution.java @@ -11,7 +11,7 @@ public int minimumObstacles(int[][] grid) { int n = grid.length; int m = grid[0].length; int[][] dirs = new int[][] {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; - Queue q = new PriorityQueue<>((a, b) -> a.removed - b.removed); + Queue q = new PriorityQueue<>((a, b) -> Integer.compare(a.removed, b.removed)); q.add(new State(0, 0, 0)); boolean[][] visited = new boolean[n][m]; visited[0][0] = true; diff --git a/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java b/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java index 925c9209d..dd9a3274a 100644 --- a/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java +++ b/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java @@ -27,9 +27,9 @@ public long maxScore(int[] nums1, int[] nums2, int k) { nums, (a, b) -> { if (a.val2 == b.val2) { - return a.val1 - b.val1; + return Integer.compare(a.val1, b.val1); } - return a.val2 - b.val2; + return Integer.compare(a.val2, b.val2); }); long sum = 0; long ans = 0; diff --git a/src/main/java/g2501_2600/s2545_sort_the_students_by_their_kth_score/Solution.java b/src/main/java/g2501_2600/s2545_sort_the_students_by_their_kth_score/Solution.java index 7f5b56cba..f89f7dd0c 100644 --- a/src/main/java/g2501_2600/s2545_sort_the_students_by_their_kth_score/Solution.java +++ b/src/main/java/g2501_2600/s2545_sort_the_students_by_their_kth_score/Solution.java @@ -6,7 +6,7 @@ public class Solution { public int[][] sortTheStudents(int[][] score, int k) { - Arrays.sort(score, (o1, o2) -> o2[k] - o1[k]); + Arrays.sort(score, (o1, o2) -> Integer.compare(o2[k], o1[k])); return score; } } diff --git a/src/main/java/g2501_2600/s2558_take_gifts_from_the_richest_pile/Solution.java b/src/main/java/g2501_2600/s2558_take_gifts_from_the_richest_pile/Solution.java index f82a22caa..31ff0cc7f 100644 --- a/src/main/java/g2501_2600/s2558_take_gifts_from_the_richest_pile/Solution.java +++ b/src/main/java/g2501_2600/s2558_take_gifts_from_the_richest_pile/Solution.java @@ -7,7 +7,7 @@ public class Solution { public long pickGifts(int[] gifts, int k) { - PriorityQueue pq = new PriorityQueue<>((a, b) -> (b - a)); + PriorityQueue pq = new PriorityQueue<>((a, b) -> (Integer.compare(b, a))); long res = 0; for (int gift : gifts) { pq.add(gift); diff --git a/src/main/java/g2601_2700/s2642_design_graph_with_shortest_path_calculator/Graph.java b/src/main/java/g2601_2700/s2642_design_graph_with_shortest_path_calculator/Graph.java index 1be47fb86..93457107a 100644 --- a/src/main/java/g2601_2700/s2642_design_graph_with_shortest_path_calculator/Graph.java +++ b/src/main/java/g2601_2700/s2642_design_graph_with_shortest_path_calculator/Graph.java @@ -37,7 +37,7 @@ public void addEdge(int[] edge) { public int shortestPath(int node1, int node2) { PriorityQueue> minHeap = - new PriorityQueue<>((a, b) -> a.getValue() - b.getValue()); + new PriorityQueue<>((a, b) -> Integer.compare(a.getValue(), b.getValue())); int[] distance = new int[adj.size()]; Arrays.fill(distance, Integer.MAX_VALUE); minHeap.add(new Pair<>(node1, 0)); diff --git a/src/main/java/g2701_2800/s2736_maximum_sum_queries/Solution.java b/src/main/java/g2701_2800/s2736_maximum_sum_queries/Solution.java index 9f0a025b5..ea9b9fa0e 100644 --- a/src/main/java/g2701_2800/s2736_maximum_sum_queries/Solution.java +++ b/src/main/java/g2701_2800/s2736_maximum_sum_queries/Solution.java @@ -44,7 +44,7 @@ public int[] maximumSumQueries(int[] nums1, int[] nums2, int[][] queries) { for (int i = 0; i < m; i++) { ind.add(i); } - ind.sort((a, b) -> queries[b][0] - queries[a][0]); + ind.sort((a, b) -> Integer.compare(queries[b][0], queries[a][0])); TreeMap values = new TreeMap<>(); int j = n - 1; int[] ans = new int[m]; diff --git a/src/main/java/g2701_2800/s2747_count_zero_request_servers/Solution.java b/src/main/java/g2701_2800/s2747_count_zero_request_servers/Solution.java index 0c6c8260f..1b873966c 100644 --- a/src/main/java/g2701_2800/s2747_count_zero_request_servers/Solution.java +++ b/src/main/java/g2701_2800/s2747_count_zero_request_servers/Solution.java @@ -7,14 +7,14 @@ public class Solution { public int[] countServers(int n, int[][] logs, int x, int[] queries) { - Arrays.sort(logs, (a, b) -> a[1] - b[1]); + Arrays.sort(logs, (a, b) -> Integer.compare(a[1], b[1])); int m = queries.length; int len = logs.length; int[][] qarr = new int[m][]; for (int i = 0; i < m; i++) { qarr[i] = new int[] {i, queries[i]}; } - Arrays.sort(qarr, (a, b) -> a[1] - b[1]); + Arrays.sort(qarr, (a, b) -> Integer.compare(a[1], b[1])); int[] ans = new int[m]; int[] freq = new int[n + 1]; int l = 0; diff --git a/src/main/java/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/Solution.java b/src/main/java/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/Solution.java index cbd5ae093..6581f588d 100644 --- a/src/main/java/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/Solution.java +++ b/src/main/java/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/Solution.java @@ -12,7 +12,7 @@ public int minimumTime(List nums1, List nums2, int x) { for (int i = 0; i < n; i++) { nums[i] = new int[] {nums1.get(i), nums2.get(i)}; } - Arrays.sort(nums, (a, b) -> a[1] - b[1]); + Arrays.sort(nums, (a, b) -> Integer.compare(a[1], b[1])); int[] dp = new int[n + 1]; long sum1 = 0; long sum2 = 0; diff --git a/src/main/java/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/Solution.java b/src/main/java/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/Solution.java index 9bca5e362..da3425bcb 100644 --- a/src/main/java/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/Solution.java +++ b/src/main/java/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/Solution.java @@ -8,7 +8,7 @@ public class Solution { public long findMaximumElegance(int[][] items, int k) { - Arrays.sort(items, (a, b) -> b[0] - a[0]); + Arrays.sort(items, (a, b) -> Integer.compare(b[0], a[0])); int n = items.length; boolean[] vis = new boolean[n]; ArrayDeque arr = new ArrayDeque<>(); diff --git a/src/main/java/g2801_2900/s2835_minimum_operations_to_form_subsequence_with_target_sum/Solution.java b/src/main/java/g2801_2900/s2835_minimum_operations_to_form_subsequence_with_target_sum/Solution.java index 5425c2592..a3cc5c2d6 100644 --- a/src/main/java/g2801_2900/s2835_minimum_operations_to_form_subsequence_with_target_sum/Solution.java +++ b/src/main/java/g2801_2900/s2835_minimum_operations_to_form_subsequence_with_target_sum/Solution.java @@ -7,7 +7,7 @@ public class Solution { public int minOperations(List nums, int target) { - PriorityQueue pq = new PriorityQueue<>((a, b) -> b - a); + PriorityQueue pq = new PriorityQueue<>((a, b) -> Integer.compare(b, a)); long sum = 0; long count = 0; for (int x : nums) { diff --git a/src/main/java/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.java b/src/main/java/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.java index d122e3b14..2098c5f00 100644 --- a/src/main/java/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.java +++ b/src/main/java/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.java @@ -34,12 +34,12 @@ private static class PQX { private PQX dp(List> g, int[] cost, int i, int p) { if (i >= g.size()) { PQX pqx = new PQX(); - pqx.max = new PriorityQueue<>((a, b) -> b - a); + pqx.max = new PriorityQueue<>((a, b) -> Integer.compare(b, a)); pqx.min = new PriorityQueue<>(Comparator.comparingInt(a -> a)); return pqx; } List next = g.get(i); - PriorityQueue pq = new PriorityQueue<>((a, b) -> b - a); + PriorityQueue pq = new PriorityQueue<>((a, b) -> Integer.compare(b, a)); PriorityQueue pq2 = new PriorityQueue<>(Comparator.comparingInt(a -> a)); if (cost[i] > 0) { pq.add(cost[i]); @@ -69,7 +69,7 @@ private PQX dp(List> g, int[] cost, int i, int p) { int bb = !pq2.isEmpty() ? pq2.poll() : 0; result[i] = Math.max(0, (long) a * b * c); result[i] = Math.max(result[i], Math.max(0, (long) a * aa * bb)); - pq = new PriorityQueue<>((x, y) -> y - x); + pq = new PriorityQueue<>((x, y) -> Integer.compare(y, x)); pq.add(a); pq.add(b); pq.add(c); diff --git a/src/main/java/g3101_3200/s3111_minimum_rectangles_to_cover_points/Solution.java b/src/main/java/g3101_3200/s3111_minimum_rectangles_to_cover_points/Solution.java index 1b032f15a..d82de6c2e 100644 --- a/src/main/java/g3101_3200/s3111_minimum_rectangles_to_cover_points/Solution.java +++ b/src/main/java/g3101_3200/s3111_minimum_rectangles_to_cover_points/Solution.java @@ -6,7 +6,7 @@ public class Solution { public int minRectanglesToCoverPoints(int[][] points, int w) { - Arrays.sort(points, (a, b) -> a[0] - b[0]); + Arrays.sort(points, (a, b) -> Integer.compare(a[0], b[0])); int res = 0; int last = -1; for (int[] a : points) { diff --git a/src/main/java/g3101_3200/s3193_count_the_number_of_inversions/Solution.java b/src/main/java/g3101_3200/s3193_count_the_number_of_inversions/Solution.java index 71c7a2565..27b303e47 100644 --- a/src/main/java/g3101_3200/s3193_count_the_number_of_inversions/Solution.java +++ b/src/main/java/g3101_3200/s3193_count_the_number_of_inversions/Solution.java @@ -8,7 +8,7 @@ public class Solution { private static final int MOD = 1_000_000_007; public int numberOfPermutations(int n, int[][] r) { - Arrays.sort(r, (o1, o2) -> o1[0] - o2[0]); + Arrays.sort(r, (o1, o2) -> Integer.compare(o1[0], o2[0])); if (r[0][0] == 0 && r[0][1] > 0) { return 0; } diff --git a/src/main/java/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/Solution.java b/src/main/java/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/Solution.java index 9e5c1e1e1..defa23965 100644 --- a/src/main/java/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/Solution.java +++ b/src/main/java/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/Solution.java @@ -35,7 +35,7 @@ static class Pair implements Comparable { @Override public int compareTo(Pair p) { - return val * p.key - key * p.val; + return Long.compare((long) val * p.key, (long) key * p.val); } } } diff --git a/src/main/java/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/Solution.java b/src/main/java/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/Solution.java index 84a177bf9..aeedce054 100644 --- a/src/main/java/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/Solution.java +++ b/src/main/java/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/Solution.java @@ -18,7 +18,7 @@ public int maxScore(List> grid) { arr[i * m + j][1] = i; } } - Arrays.sort(arr, (a, b) -> b[0] - a[0]); + Arrays.sort(arr, (a, b) -> Integer.compare(b[0], a[0])); int[] dp = new int[1 << n]; int i = 0; while (i < arr.length) { diff --git a/src/main/java/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.java b/src/main/java/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.java index f6ffcb1f4..4fa31b0ab 100644 --- a/src/main/java/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.java +++ b/src/main/java/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.java @@ -20,17 +20,17 @@ public int maxPathLength(int[][] coordinates, int k) { upper.sort( (a, b) -> { if (a[0] == b[0]) { - return b[1] - a[1]; + return Integer.compare(b[1], a[1]); } else { - return a[0] - b[0]; + return Integer.compare(a[0], b[0]); } }); lower.sort( (a, b) -> { if (a[0] == b[0]) { - return b[1] - a[1]; + return Integer.compare(b[1], a[1]); } else { - return a[0] - b[0]; + return Integer.compare(a[0], b[0]); } }); return longestIncreasingLength(upper) + longestIncreasingLength(lower) + 1; diff --git a/src/main/java/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/Solution.java b/src/main/java/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/Solution.java index 178817555..287994bf4 100644 --- a/src/main/java/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/Solution.java +++ b/src/main/java/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/Solution.java @@ -27,9 +27,9 @@ public int[] findXSum(int[] nums, int k, int x) { new PriorityQueue<>( (a, b) -> { if (a.freq == b.freq) { - return b.num - a.num; + return Integer.compare(b.num, a.num); } - return b.freq - a.freq; + return Integer.compare(b.freq, a.freq); }); for (int j = i; j < i + k; j++) { map.put(nums[j], map.getOrDefault(nums[j], 0) + 1); diff --git a/src/main/java/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/Solution.java b/src/main/java/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/Solution.java index 0d860b8b3..6a12b2147 100644 --- a/src/main/java/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/Solution.java +++ b/src/main/java/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/Solution.java @@ -20,9 +20,9 @@ private static class RC implements Comparable { public int compareTo(RC o) { if (cnt != o.cnt) { - return cnt - o.cnt; + return Integer.compare(cnt, o.cnt); } - return val - o.val; + return Integer.compare(val, o.val); } } diff --git a/src/main/java/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/Solution.java b/src/main/java/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/Solution.java index fb87c6502..a973a6e0e 100644 --- a/src/main/java/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/Solution.java +++ b/src/main/java/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/Solution.java @@ -16,7 +16,7 @@ private static class Node { private final int[][] dir = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; public int minTimeToReach(int[][] moveTime) { - PriorityQueue pq = new PriorityQueue<>((a, b) -> a.t - b.t); + PriorityQueue pq = new PriorityQueue<>((a, b) -> Integer.compare(a.t, b.t)); int m = moveTime.length; int n = moveTime[0].length; Node node = new Node(); diff --git a/src/main/java/g3301_3400/s3362_zero_array_transformation_iii/Solution.java b/src/main/java/g3301_3400/s3362_zero_array_transformation_iii/Solution.java index 3fc46add3..b0cae5b92 100644 --- a/src/main/java/g3301_3400/s3362_zero_array_transformation_iii/Solution.java +++ b/src/main/java/g3301_3400/s3362_zero_array_transformation_iii/Solution.java @@ -8,8 +8,8 @@ public class Solution { public int maxRemoval(int[] nums, int[][] queries) { - Arrays.sort(queries, (a, b) -> a[0] - b[0]); - PriorityQueue last = new PriorityQueue<>((a, b) -> b - a); + Arrays.sort(queries, (a, b) -> Integer.compare(a[0], b[0])); + PriorityQueue last = new PriorityQueue<>((a, b) -> Integer.compare(b, a)); int[] diffs = new int[nums.length + 1]; int idx = 0; int cur = 0; diff --git a/src/main/java/g3301_3400/s3377_digit_operations_to_make_two_integers_equal/Solution.java b/src/main/java/g3301_3400/s3377_digit_operations_to_make_two_integers_equal/Solution.java index f87977e5b..06b7b5fca 100644 --- a/src/main/java/g3301_3400/s3377_digit_operations_to_make_two_integers_equal/Solution.java +++ b/src/main/java/g3301_3400/s3377_digit_operations_to_make_two_integers_equal/Solution.java @@ -24,7 +24,7 @@ public int minOperations(int n, int m) { if (sieve[n]) { return -1; } - PriorityQueue pq = new PriorityQueue<>((a, b) -> a[0] - b[0]); + PriorityQueue pq = new PriorityQueue<>((a, b) -> Integer.compare(a[0], b[0])); visited[n] = true; pq.add(new int[] {n, n}); while (!pq.isEmpty()) { diff --git a/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java b/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java index 457b77a3e..1b3907635 100644 --- a/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java +++ b/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java @@ -7,7 +7,7 @@ public class Solution { public long maximumCoins(int[][] coins, int k) { - Arrays.sort(coins, (a, b) -> a[0] - b[0]); + Arrays.sort(coins, (a, b) -> Integer.compare(a[0], b[0])); int n = coins.length; long res = 0; long cur = 0; diff --git a/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java b/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java index c1f2367f8..4833c4807 100644 --- a/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java +++ b/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java @@ -17,7 +17,7 @@ public int[] maximumWeight(List> intervals) { } int[][] dp1 = new int[n][0]; long[] dp = new long[n]; - Arrays.sort(ns, (a, b) -> a[0] - b[0]); + Arrays.sort(ns, (a, b) -> Integer.compare(a[0], b[0])); for (int k = 0; k < 4; ++k) { int[][] dp3 = new int[n][]; long[] dp2 = new long[n]; diff --git a/src/main/java/g3501_3600/s3551_minimum_swaps_to_sort_by_digit_sum/Solution.java b/src/main/java/g3501_3600/s3551_minimum_swaps_to_sort_by_digit_sum/Solution.java index 98be60430..69d647463 100644 --- a/src/main/java/g3501_3600/s3551_minimum_swaps_to_sort_by_digit_sum/Solution.java +++ b/src/main/java/g3501_3600/s3551_minimum_swaps_to_sort_by_digit_sum/Solution.java @@ -33,9 +33,9 @@ public int minSwaps(int[] arr) { pairs, (a, b) -> { if (a.sum != b.sum) { - return a.sum - b.sum; + return Integer.compare(a.sum, b.sum); } - return a.value - b.value; + return Integer.compare(a.value, b.value); }); int[] posMap = new int[n]; for (int i = 0; i < n; i++) { diff --git a/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java b/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java index 51811b38c..38f67eb41 100644 --- a/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java +++ b/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java @@ -35,7 +35,7 @@ public long maxAlternatingSum(int[] nums, int[][] swaps) { if (r != i) { continue; } - list[i].sort((a, b) -> a - b); + list[i].sort((a, b) -> Integer.compare(a, b)); for (int j = 0; j < list[i].size(); j++) { result += (long) list[i].get(j) * (j < oddCount[r] ? -1 : 1); } From 01b4ac5c0fe1ec43ae14eeeb8594ccb1ffe2381f Mon Sep 17 00:00:00 2001 From: ThanhNIT Date: Tue, 8 Sep 2026 21:14:18 +0700 Subject: [PATCH 2/3] format code --- src/main/java/g0501_0600/s0502_ipo/Solution.java | 3 ++- .../s1383_maximum_performance_of_a_team/Solution.java | 3 ++- .../g1801_1900/s1882_process_tasks_using_servers/Solution.java | 3 ++- 3 files changed, 6 insertions(+), 3 deletions(-) diff --git a/src/main/java/g0501_0600/s0502_ipo/Solution.java b/src/main/java/g0501_0600/s0502_ipo/Solution.java index 62d57928b..9f178c95e 100644 --- a/src/main/java/g0501_0600/s0502_ipo/Solution.java +++ b/src/main/java/g0501_0600/s0502_ipo/Solution.java @@ -10,7 +10,8 @@ public class Solution { public int findMaximizedCapital(int k, int w, int[] profits, int[] capital) { PriorityQueue minCapital = new PriorityQueue<>(Comparator.comparingInt((int[] a) -> a[1])); - PriorityQueue maxProfit = new PriorityQueue<>((int[] a, int[] b) -> Integer.compare(b[0], a[0])); + PriorityQueue maxProfit = + new PriorityQueue<>((int[] a, int[] b) -> Integer.compare(b[0], a[0])); for (int i = 0; i < profits.length; i++) { if (w >= capital[i]) { maxProfit.offer(new int[] {profits[i], capital[i]}); diff --git a/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java b/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java index a34f97368..dcd1eb11e 100644 --- a/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java +++ b/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java @@ -13,7 +13,8 @@ public int maxPerformance(int n, int[] speed, int[] efficiency, int k) { engineers[i][0] = speed[i]; engineers[i][1] = efficiency[i]; } - Arrays.sort(engineers, (engineer1, engineer2) -> Integer.compare(engineer2[1], engineer1[1])); + Arrays.sort( + engineers, (engineer1, engineer2) -> Integer.compare(engineer2[1], engineer1[1])); long speedSum = 0; long maximumPerformance = 0; PriorityQueue minHeap = new PriorityQueue<>(); diff --git a/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java b/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java index 2076bdbbc..6f1b20c86 100644 --- a/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java +++ b/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java @@ -13,7 +13,8 @@ public int[] assignTasks(int[] servers, int[] tasks) { for (int i = 0; i < servers.length; i++) { serverq.offer(i); } - PriorityQueue activetaskq = new PriorityQueue<>((i1, i2) -> Integer.compare(i1[1], i2[1])); + PriorityQueue activetaskq = + new PriorityQueue<>((i1, i2) -> Integer.compare(i1[1], i2[1])); int time = 0; int[] res = new int[tasks.length]; for (int i = 0; i < tasks.length; i++) { From 4ced4a3f4ce715c299aeb739ed7ab634e07232ee Mon Sep 17 00:00:00 2001 From: ThanhNIT Date: Tue, 8 Sep 2026 21:44:08 +0700 Subject: [PATCH 3/3] Update Solution.java --- .../s3695_maximize_alternating_sum_using_swaps/Solution.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java b/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java index 38f67eb41..bc8c9fba3 100644 --- a/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java +++ b/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java @@ -35,7 +35,7 @@ public long maxAlternatingSum(int[] nums, int[][] swaps) { if (r != i) { continue; } - list[i].sort((a, b) -> Integer.compare(a, b)); + list[i].sort(Integer::compare); for (int j = 0; j < list[i].size(); j++) { result += (long) list[i].get(j) * (j < oddCount[r] ? -1 : 1); }