From bd189f66785377380e86543bd2764c0c53afe3a2 Mon Sep 17 00:00:00 2001 From: Valentyn Kolesnikov Date: Wed, 26 Feb 2025 05:13:31 +0200 Subject: [PATCH 1/3] Improved tasks 2678, 2679, 2706, 2703, 2711 --- .../s2678_number_of_senior_citizens/Solution.java | 4 ++-- .../java/g2601_2700/s2679_sum_in_a_matrix/Solution.java | 3 --- .../s2703_return_length_of_arguments_passed/solution.ts | 6 ++++-- .../java/g2701_2800/s2706_buy_two_chocolates/Solution.java | 3 --- .../Solution.java | 6 ------ 5 files changed, 6 insertions(+), 16 deletions(-) diff --git a/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java b/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java index 8fca4316f..b9b9115c8 100644 --- a/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java +++ b/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java @@ -6,8 +6,8 @@ public class Solution { public int countSeniors(String[] details) { int count = 0; for (String detail : details) { - if (((detail.charAt(11) - '0' == 6) && (detail.charAt(12) - '0' > 0)) - || (detail.charAt(11) - '0' > 6)) { + if ((detail.charAt(11) - '0' == 6 && detail.charAt(12) - '0' > 0) + || detail.charAt(11) - '0' > 6) { count++; } } diff --git a/src/main/java/g2601_2700/s2679_sum_in_a_matrix/Solution.java b/src/main/java/g2601_2700/s2679_sum_in_a_matrix/Solution.java index b8860696f..fdabf7acd 100644 --- a/src/main/java/g2601_2700/s2679_sum_in_a_matrix/Solution.java +++ b/src/main/java/g2601_2700/s2679_sum_in_a_matrix/Solution.java @@ -8,12 +8,10 @@ public class Solution { public int matrixSum(int[][] nums) { int result = 0; - for (int[] row : nums) { Arrays.sort(row); reverseArray(row); } - for (int i = 0; i < nums[0].length; i++) { int max = 0; for (int[] num : nums) { @@ -21,7 +19,6 @@ public int matrixSum(int[][] nums) { } result += max; } - return result; } diff --git a/src/main/java/g2701_2800/s2703_return_length_of_arguments_passed/solution.ts b/src/main/java/g2701_2800/s2703_return_length_of_arguments_passed/solution.ts index 4a30aab86..96b94092a 100644 --- a/src/main/java/g2701_2800/s2703_return_length_of_arguments_passed/solution.ts +++ b/src/main/java/g2701_2800/s2703_return_length_of_arguments_passed/solution.ts @@ -1,6 +1,8 @@ -// #Easy #2023_09_14_Time_49_ms_(86.01%)_Space_42.9_MB_(39.39%) +// #Easy #2025_02_26_Time_50_ms_(82.03%)_Space_54.95_MB_(7.19%) -function argumentsLength(...args: any[]): number { +type JSONValue = null | boolean | number | string | JSONValue[] | { [key: string]: JSONValue }; + +function argumentsLength(...args: JSONValue[]): number { return args.length } diff --git a/src/main/java/g2701_2800/s2706_buy_two_chocolates/Solution.java b/src/main/java/g2701_2800/s2706_buy_two_chocolates/Solution.java index 81488cd8e..e4501092d 100644 --- a/src/main/java/g2701_2800/s2706_buy_two_chocolates/Solution.java +++ b/src/main/java/g2701_2800/s2706_buy_two_chocolates/Solution.java @@ -6,7 +6,6 @@ public class Solution { public int buyChoco(int[] prices, int money) { int minPrice1 = Integer.MAX_VALUE; int minPrice2 = Integer.MAX_VALUE; - for (int price : prices) { if (price < minPrice1) { minPrice2 = minPrice1; @@ -15,9 +14,7 @@ public int buyChoco(int[] prices, int money) { minPrice2 = price; } } - int totalPrice = minPrice1 + minPrice2; - if (totalPrice > money) { return money; } else { diff --git a/src/main/java/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals/Solution.java b/src/main/java/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals/Solution.java index 649610c5b..ebfa6118a 100644 --- a/src/main/java/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals/Solution.java +++ b/src/main/java/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals/Solution.java @@ -11,7 +11,6 @@ public int[][] differenceOfDistinctValues(int[][] grid) { int n = grid[0].length; int[][] arrTopLeft = new int[m][n]; int[][] arrBotRight = new int[m][n]; - for (int i = m - 1; i >= 0; i--) { int c = 0; int r = i; @@ -21,7 +20,6 @@ public int[][] differenceOfDistinctValues(int[][] grid) { set.add(grid[r++][c++]); } } - for (int i = 1; i < n; i++) { int r = 0; int c = i; @@ -31,7 +29,6 @@ public int[][] differenceOfDistinctValues(int[][] grid) { set.add(grid[r++][c++]); } } - for (int i = 0; i < n; i++) { int r = m - 1; int c = i; @@ -41,7 +38,6 @@ public int[][] differenceOfDistinctValues(int[][] grid) { set.add(grid[r--][c--]); } } - for (int i = m - 1; i >= 0; i--) { int c = n - 1; int r = i; @@ -51,14 +47,12 @@ public int[][] differenceOfDistinctValues(int[][] grid) { set.add(grid[r--][c--]); } } - int[][] result = new int[m][n]; for (int r = 0; r < m; r++) { for (int c = 0; c < n; c++) { result[r][c] = Math.abs(arrTopLeft[r][c] - arrBotRight[r][c]); } } - return result; } From 68de56dab0f5fb95357cc4f8875e38e305c464c4 Mon Sep 17 00:00:00 2001 From: Valentyn Kolesnikov Date: Wed, 26 Feb 2025 05:19:33 +0200 Subject: [PATCH 2/3] Improved 2678 --- .../g2601_2700/s2678_number_of_senior_citizens/Solution.java | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java b/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java index b9b9115c8..046e2d640 100644 --- a/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java +++ b/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java @@ -6,8 +6,8 @@ public class Solution { public int countSeniors(String[] details) { int count = 0; for (String detail : details) { - if ((detail.charAt(11) - '0' == 6 && detail.charAt(12) - '0' > 0) - || detail.charAt(11) - '0' > 6) { + if (detail.charAt(11) - '0' == 6 && detail.charAt(12) - '0' > 0 + || detail.charAt(11) - '0' > 6) { count++; } } From 2536be40bf44610bed0f51a0f91adc2d6811de71 Mon Sep 17 00:00:00 2001 From: Valentyn Kolesnikov Date: Wed, 26 Feb 2025 05:24:09 +0200 Subject: [PATCH 3/3] Improved 2678 --- .../s2678_number_of_senior_citizens/Solution.java | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java b/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java index 046e2d640..d11b5b073 100644 --- a/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java +++ b/src/main/java/g2601_2700/s2678_number_of_senior_citizens/Solution.java @@ -1,16 +1,16 @@ package g2601_2700.s2678_number_of_senior_citizens; -// #Easy #Array #String #2023_09_11_Time_0_ms_(100.00%)_Space_40.7_MB_(97.65%) +// #Easy #Array #String #2025_02_26_Time_0_ms_(100.00%)_Space_42.10_MB_(95.99%) public class Solution { public int countSeniors(String[] details) { - int count = 0; + int seniorCitizen = 0; for (String detail : details) { - if (detail.charAt(11) - '0' == 6 && detail.charAt(12) - '0' > 0 - || detail.charAt(11) - '0' > 6) { - count++; + int age = (detail.charAt(11) - '0') * 10 + detail.charAt(12) - '0'; + if (age > 60) { + seniorCitizen++; } } - return count; + return seniorCitizen; } }