Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit f54b094

Browse files
authored
Improved task 1764.
1 parent 3d27200 commit f54b094

File tree

2 files changed

+30
-20
lines changed
  • src.save/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array

2 files changed

+30
-20
lines changed

‎README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2289,7 +2289,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
22892289
| 1768 |[Merge Strings Alternately](src.save/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java)| Easy | String, Two_Pointers, Programming_Skills_I_Day_8_String | 1 | 86.26
22902290
| 1766 |[Tree of Coprimes](src.save/main/java/g1701_1800/s1766_tree_of_coprimes/Solution.java)| Hard | Math, Depth_First_Search, Breadth_First_Search, Tree | 111 | 94.07
22912291
| 1765 |[Map of Highest Peak](src.save/main/java/g1701_1800/s1765_map_of_highest_peak/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 64 | 85.40
2292-
| 1764 |[Form Array by Concatenating Subarrays of Another Array](src.save/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/Solution.java)| Medium | Array, Greedy, String_Matching | 7 | 16.90
2292+
| 1764 |[Form Array by Concatenating Subarrays of Another Array](src.save/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/Solution.java)| Medium | Array, Greedy, String_Matching | 3 | 43.69
22932293
| 1763 |[Longest Nice Substring](src.save/main/java/g1701_1800/s1763_longest_nice_substring/Solution.java)| Easy | String, Hash_Table, Bit_Manipulation, Sliding_Window | 5 | 61.88
22942294
| 1761 |[Minimum Degree of a Connected Trio in a Graph](src.save/main/java/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/Solution.java)| Hard | Graph | 33 | 89.17
22952295
| 1760 |[Minimum Limit of Balls in a Bag](src.save/main/java/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag/Solution.java)| Medium | Array, Binary_Search, Binary_Search_II_Day_3 | 44 | 78.49

‎src.save/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/Solution.java‎

Lines changed: 29 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -1,29 +1,39 @@
11
package g1701_1800.s1764_form_array_by_concatenating_subarrays_of_another_array;
22

3-
// #Medium #Array #Greedy #String_Matching #2022_04_30_Time_7_ms_(16.90%)_Space_42.4_MB_(85.92%)
3+
// #Medium #Array #Greedy #String_Matching #2022_07_12_Time_3_ms_(43.69%)_Space_45.5_MB_(69.90%)
44

5-
import java.util.ArrayList;
6-
import java.util.Collections;
7-
import java.util.List;
5+
import java.util.Arrays;
86

97
public class Solution {
108
public boolean canChoose(int[][] groups, int[] nums) {
11-
List<Integer> numsInt = new ArrayList<>();
12-
for (int num : nums) {
13-
numsInt.add(num);
14-
}
15-
int prevIndex = 0;
16-
for (int[] group : groups) {
17-
List<Integer> groupInt = new ArrayList<>();
18-
for (int num : group) {
19-
groupInt.add(num);
9+
int prev = 0;
10+
for (int i = 0; i < groups.length; i++) {
11+
int[] temp = new int[groups[i].length];
12+
if (prev + groups[i].length > nums.length) {
13+
return false;
14+
}
15+
int index = 0;
16+
int j;
17+
for (j = prev; j < prev + groups[i].length; j++) {
18+
temp[index++] = nums[j];
19+
}
20+
if (Arrays.equals(temp, groups[i])) {
21+
prev = j;
22+
continue;
23+
}
24+
int k;
25+
for (k = j; k < nums.length; k++) {
26+
int l;
27+
for (l = 0; l < temp.length - 1; l++) {
28+
temp[l] = temp[l + 1];
29+
}
30+
temp[l] = nums[k];
31+
if (Arrays.equals(temp, groups[i])) {
32+
prev = k + 1;
33+
break;
34+
}
2035
}
21-
int index =
22-
Collections.indexOfSubList(
23-
numsInt.subList(prevIndex, numsInt.size()), groupInt);
24-
if (index != -1) {
25-
prevIndex = index + group.length;
26-
} else {
36+
if (k == nums.length) {
2737
return false;
2838
}
2939
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /