Movatterモバイル変換

[0]ホーム
URL:

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

Commit4d2240f

Browse files
authored
Improved tasks 620, 1012, 1309, 1392
1 parentc85f6f3 commit4d2240f

File tree

5 files changed

+45
-65
lines changed

5 files changed

+45
-65
lines changed
Lines changed: 5 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
# Write your MySQL query statement below
2-
# #Easy #Database #2022_03_21_Time_258_ms_(28.33%)_Space_0B_(100.00%)
3-
SELECT*
4-
FROM cinema
5-
WHERE description!='boring'
6-
AND ID %2=1
7-
ORDER BY ratingdesc;
2+
# #Easy #Database #2025_04_23_Time_259_ms_(64.69%)_Space_0.0_MB_(100.00%)
3+
SELECT id, movie, description, rating
4+
FROM Cinema
5+
WHERE description!='boring'AND id %2!=0
6+
ORDER BY ratingDESC;

‎src/main/java/g1001_1100/s1012_numbers_with_repeated_digits/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg1001_1100.s1012_numbers_with_repeated_digits;
22

3-
// #Hard #Dynamic_Programming #Math #2022_02_25_Time_3_ms_(28.17%)_Space_41.8_MB_(7.04%)
3+
// #Hard #Dynamic_Programming #Math #2025_04_23_Time_2_ms_(50.64%)_Space_40.70_MB_(60.90%)
44

55
importjava.util.HashSet;
66

Lines changed: 15 additions & 43 deletions
Original file line numberDiff line numberDiff line change
@@ -1,54 +1,26 @@
11
packageg1301_1400.s1309_decrypt_string_from_alphabet_to_integer_mapping;
22

33
// #Easy #String #Programming_Skills_I_Day_9_String
4-
// #2022_03_15_Time_6_ms_(28.25%)_Space_42.6_MB_(29.40%)
5-
6-
importjava.util.HashMap;
7-
importjava.util.Map;
4+
// #2025_04_23_Time_0_ms_(100.00%)_Space_41.42_MB_(89.95%)
85

96
publicclassSolution {
107
publicStringfreqAlphabets(Strings) {
11-
Map<String,String>map =newHashMap<>();
12-
map.put("1","a");
13-
map.put("2","b");
14-
map.put("3","c");
15-
map.put("4","d");
16-
map.put("5","e");
17-
map.put("6","f");
18-
map.put("7","g");
19-
map.put("8","h");
20-
map.put("9","i");
21-
map.put("10#","j");
22-
map.put("11#","k");
23-
map.put("12#","l");
24-
map.put("13#","m");
25-
map.put("14#","n");
26-
map.put("15#","o");
27-
map.put("16#","p");
28-
map.put("17#","q");
29-
map.put("18#","r");
30-
map.put("19#","s");
31-
map.put("20#","t");
32-
map.put("21#","u");
33-
map.put("22#","v");
34-
map.put("23#","w");
35-
map.put("24#","x");
36-
map.put("25#","y");
37-
map.put("26#","z");
38-
StringBuildersb =newStringBuilder();
39-
inti =0;
40-
while (i <s.length()) {
41-
if ((Integer.parseInt("" +s.charAt(i)) ==1 ||Integer.parseInt("" +s.charAt(i)) ==2)
42-
&&i +1 <s.length()
43-
&&i +2 <s.length()
44-
&&s.charAt(i +2) =='#') {
45-
sb.append(map.get(s.substring(i,i +3)));
46-
i +=3;
8+
StringBuilderbuilder =newStringBuilder();
9+
inti =s.length() -1;
10+
while (i >=0) {
11+
if (s.charAt(i) =='#') {
12+
decryptor(builder,i -1,i -2,s);
13+
i -=3;
4714
}else {
48-
sb.append(map.get("" +s.charAt(i)));
49-
i++;
15+
charch = (char) (s.charAt(i) -'0' +96);
16+
builder.append(ch);
17+
i--;
5018
}
5119
}
52-
returnsb.toString();
20+
returnbuilder.reverse().toString();
21+
}
22+
23+
privatevoiddecryptor(StringBuilderbuilder,inta,intb,Strings) {
24+
builder.append((char) (((s.charAt(b) -'0') *10 +s.charAt(a) -'0') +96));
5325
}
5426
}
Lines changed: 19 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,25 +1,29 @@
11
packageg1301_1400.s1392_longest_happy_prefix;
22

33
// #Hard #String #Hash_Function #String_Matching #Rolling_Hash
4-
// #2022_03_17_Time_39_ms_(28.37%)_Space_42.6_MB_(94.23%)
4+
// #2025_04_23_Time_5_ms_(100.00%)_Space_45.92_MB_(23.63%)
55

66
publicclassSolution {
77
publicStringlongestPrefix(Strings) {
8-
inttimes =2;
9-
longprefixHash =0;
10-
longsuffixHash =0;
11-
longmultiplier =1;
12-
longlen =0;
13-
// use some large prime as a modulo to avoid overflow errors, e.g. 10 ^ 9 + 7.
14-
longmod =1000000007;
15-
for (inti =0;i <s.length() -1;i++) {
16-
prefixHash = (prefixHash *times +s.charAt(i)) %mod;
17-
suffixHash = (multiplier *s.charAt(s.length() -i -1) +suffixHash) %mod;
18-
if (prefixHash ==suffixHash) {
19-
len = (long)i +1;
8+
char[]c =s.toCharArray();
9+
intn =c.length;
10+
int[]a =newint[n];
11+
intmax =0;
12+
inti =1;
13+
while (i <n) {
14+
if (c[max] ==c[i]) {
15+
max++;
16+
a[i] =max;
17+
i++;
18+
}else {
19+
if (max >0) {
20+
max =a[max -1];
21+
}else {
22+
a[i] =0;
23+
i++;
24+
}
2025
}
21-
multiplier =multiplier *times %mod;
2226
}
23-
returns.substring(0,(int)len);
27+
returns.substring(0,a[n -1]);
2428
}
2529
}

‎src/test/java/g1301_1400/s1392_longest_happy_prefix/SolutionTest.java

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,9 @@ void longestPrefix() {
1515
voidlongestPrefix2() {
1616
assertThat(newSolution().longestPrefix("ababab"),equalTo("abab"));
1717
}
18+
19+
@Test
20+
voidlongestPrefix3() {
21+
assertThat(newSolution().longestPrefix("babbb"),equalTo("b"));
22+
}
1823
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp