Skip to content

Commit d8e8f5a

Browse files
committed
Added task 3611
1 parent 2faae1c commit d8e8f5a

File tree

33 files changed

+247
-140
lines changed
  • src/main/java
    • g0001_0100/s0068_text_justification
    • g0201_0300/s0297_serialize_and_deserialize_binary_tree
    • g0401_0500
    • g0701_0800/s0753_cracking_the_safe
    • g0901_1000/s0972_equal_rational_numbers
    • g1101_1200/s1138_alphabet_board_path
    • g1501_1600/s1592_rearrange_spaces_between_words
    • g1601_1700/s1643_kth_smallest_instructions
    • g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array
    • g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another
    • g2301_2400
    • g2401_2500
      • s2441_largest_positive_integer_that_exists_with_its_negative
      • s2500_delete_greatest_value_in_each_row
    • g2501_2600/s2598_smallest_missing_non_negative_integer_after_operations
    • g2601_2700/s2661_first_completely_painted_row_or_column
    • g2701_2800/s2799_count_complete_subarrays_in_an_array
    • g2801_2900/s2899_last_visited_integers
    • g3101_3200
      • s3122_minimum_number_of_operations_to_satisfy_conditions
      • s3138_minimum_length_of_anagram_concatenation
      • s3164_find_the_number_of_good_pairs_ii
      • s3165_maximum_sum_of_subsequence_with_non_adjacent_elements
      • s3190_find_minimum_operations_to_make_all_elements_divisible_by_three
    • g3301_3400
      • s3305_count_of_substrings_containing_every_vowel_and_k_consonants_i
      • s3394_check_if_grid_can_be_cut_into_sections
    • g3401_3500
    • g3501_3600
      • s3558_number_of_ways_to_assign_edge_weights_i
      • s3575_maximum_good_subtree_score
    • g3601_3700
      • s3609_minimum_moves_to_reach_target_in_grid
      • s3611_find_overbooked_employees

33 files changed

+247
-140
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2088,6 +2088,7 @@
20882088

20892089
| # | Title | Difficulty | Tag | Time, ms | Time, %
20902090
|------|----------------|-------------|-------------|----------|--------
2091+
| 3611 |[Find Overbooked Employees](src/main/java/g3601_3700/s3611_find_overbooked_employees)| Medium | Database | 516 | 100.00
20912092
| 3609 |[Minimum Moves to Reach Target in Grid](src/main/java/g3601_3700/s3609_minimum_moves_to_reach_target_in_grid)| Hard | Math | 1 | 99.42
20922093
| 3608 |[Minimum Time for K Connected Components](src/main/java/g3601_3700/s3608_minimum_time_for_k_connected_components)| Medium | Sorting, Binary_Search, Graph, Union_Find | 29 | 100.00
20932094
| 3607 |[Power Grid Maintenance](src/main/java/g3601_3700/s3607_power_grid_maintenance)| Medium | Array, Hash_Table, Depth_First_Search, Breadth_First_Search, Heap_Priority_Queue, Graph, Union_Find, Ordered_Set | 84 | 94.64

src/main/java/g0001_0100/s0068_text_justification/readme.md

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -91,9 +91,8 @@ public class Solution {
9191
sb.append(' ');
9292
}
9393
// appending the rest of the required spaces
94-
for (int k = 0; k < (maxWidth - lineTotal) / (numWordsOnLine - 1); k++) {
95-
sb.append(' ');
96-
}
94+
int max = Math.max(0, (maxWidth - lineTotal) / (numWordsOnLine - 1));
95+
sb.append(" ".repeat(max));
9796
}
9897
// appending the last word of the line
9998
sb.append(words[startWord + numWordsOnLine - 1]);

src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/readme.md

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -77,11 +77,7 @@ public class Codec {
7777
return;
7878
}
7979
String s = Integer.toHexString(root.val + BASE_OFFSET);
80-
StringBuilder sb2 = new StringBuilder();
81-
for (int i = 0; i < 3 - s.length(); i++) {
82-
sb2.append('0');
83-
}
84-
sb2.append(s);
80+
String sb2 = "0".repeat(Math.max(0, 3 - s.length())) + s;
8581
sb.append(sb2);
8682
serialize(root.left, sb);
8783
serialize(root.right, sb);

src/main/java/g0401_0500/s0451_sort_characters_by_frequency/readme.md

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -64,9 +64,7 @@ public class Solution {
6464
for (Map.Entry<Integer, List<Character>> freq : reverseMap.entrySet()) {
6565
List<Character> list = reverseMap.get(freq.getKey());
6666
for (char c : list) {
67-
for (int i = 0; i < freq.getKey(); i++) {
68-
sb.append(c);
69-
}
67+
sb.append(String.valueOf(c).repeat(Math.max(0, freq.getKey())));
7068
}
7169
}
7270
return sb.toString();

src/main/java/g0401_0500/s0494_target_sum/readme.md

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -47,9 +47,8 @@ Return the number of different **expressions** that you can build, which evaluat
4747
public class Solution {
4848
public int findTargetSumWays(int[] nums, int target) {
4949
int totalSum = 0;
50-
int n = nums.length;
51-
for (int i = 0; i < n; i++) {
52-
totalSum += nums[i];
50+
for (int num : nums) {
51+
totalSum += num;
5352
}
5453
int sum = totalSum - target;
5554
if (sum < 0 || sum % 2 == 1) {

src/main/java/g0701_0800/s0753_cracking_the_safe/readme.md

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -59,9 +59,7 @@ public class Solution {
5959
visited[0] = true;
6060
int visitedCnt = 1;
6161
StringBuilder crackStr = new StringBuilder();
62-
for (int i = 0; i < n; i++) {
63-
crackStr.append('0');
64-
}
62+
crackStr.append("0".repeat(Math.max(0, n)));
6563
dfsAddPwd(n, k, crackStr, 0, visited, visitedCnt, targetCnt);
6664
return foundStr;
6765
}

src/main/java/g0901_1000/s0972_equal_rational_numbers/readme.md

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -82,11 +82,7 @@ public class Solution {
8282
}
8383

8484
private String repeat(String a) {
85-
StringBuilder sb = new StringBuilder();
86-
for (int i = 0; i < 100; i++) {
87-
sb.append(a);
88-
}
89-
return sb.toString();
85+
return String.valueOf(a).repeat(100);
9086
}
9187
}
9288
```

src/main/java/g1101_1200/s1138_alphabet_board_path/readme.md

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -76,9 +76,7 @@ public class Solution {
7676

7777
public StringBuilder helper(String dir, int time) {
7878
StringBuilder path = new StringBuilder();
79-
for (int i = 0; i < time; i++) {
80-
path.append(dir);
81-
}
79+
path.append(String.valueOf(dir).repeat(Math.max(0, time)));
8280
return path;
8381
}
8482
}

src/main/java/g1501_1600/s1592_rearrange_spaces_between_words/readme.md

Lines changed: 3 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -46,25 +46,17 @@ public class Solution {
4646
}
4747
String[] words = text.trim().split("\\s+");
4848
if (words.length == 1) {
49-
StringBuilder sb = new StringBuilder(words[0]);
50-
for (int i = 0; i < spaceCount; i++) {
51-
sb.append(" ");
52-
}
53-
return sb.toString();
49+
return words[0] + " ".repeat(Math.max(0, spaceCount));
5450
}
5551
int trailingSpaces = spaceCount % (words.length - 1);
5652
int newSpaces = spaceCount / (words.length - 1);
5753
StringBuilder sb = new StringBuilder();
5854
for (int j = 0; j < words.length; j++) {
5955
sb.append(words[j]);
6056
if (j < words.length - 1) {
61-
for (int i = 0; i < newSpaces; i++) {
62-
sb.append(" ");
63-
}
57+
sb.append(" ".repeat(Math.max(0, newSpaces)));
6458
} else {
65-
for (int i = 0; i < trailingSpaces; i++) {
66-
sb.append(" ");
67-
}
59+
sb.append(" ".repeat(Math.max(0, trailingSpaces)));
6860
}
6961
}
7062
return sb.toString();

src/main/java/g1601_1700/s1643_kth_smallest_instructions/readme.md

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -69,14 +69,10 @@ public class Solution {
6969
k -= range;
7070
}
7171
if (v == 0) {
72-
for (int i = 1; i <= n; i++) {
73-
sb.append('H');
74-
}
72+
sb.append("H".repeat(Math.max(0, n)));
7573
break;
7674
} else if (v == n) {
77-
for (int i = 1; i <= v; i++) {
78-
sb.append('V');
79-
}
75+
sb.append("V".repeat(Math.max(0, v)));
8076
break;
8177
}
8278
}

0 commit comments

Comments
 (0)