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

Commitf0c39f6

Browse files
authored
Updated tasks 22-48
1 parentb81db41 commitf0c39f6

File tree

16 files changed

+47
-51
lines changed

16 files changed

+47
-51
lines changed

‎README.md

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -284,7 +284,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.37'
284284
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
285285
|-|-|-|-|-|-
286286
| 0077 |[Combinations](src/main/java/g0001_0100/s0077_combinations/Solution.java)| Medium | Backtracking | 11 | 77.40
287-
| 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 |95.07
287+
| 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 |94.08
288288
| 0784 |[Letter Case Permutation](src/main/java/g0701_0800/s0784_letter_case_permutation/Solution.java)| Medium | String, Bit_Manipulation, Backtracking | 10 | 40.38
289289

290290
####Day 12 Dynamic Programming
@@ -383,7 +383,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.37'
383383
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
384384
|-|-|-|-|-|-
385385
| 0047 |[Permutations II](src/main/java/g0001_0100/s0047_permutations_ii/Solution.java)| Medium | Array, Backtracking | 1 | 99.86
386-
| 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 |100.00
386+
| 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 |99.99
387387
| 0040 |[Combination Sum II](src/main/java/g0001_0100/s0040_combination_sum_ii/Solution.java)| Medium | Array, Backtracking | 2 | 99.75
388388

389389
####Day 11 Recursion Backtracking
@@ -405,7 +405,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.37'
405405

406406
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
407407
|-|-|-|-|-|-
408-
| 0045 |[Jump Game II](src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) |2 |49.02
408+
| 0045 |[Jump Game II](src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) |0 |100.00
409409
| 0062 |[Unique Paths](src/main/java/g0001_0100/s0062_unique_paths/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00
410410

411411
####Day 14 Dynamic Programming
@@ -719,7 +719,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.37'
719719
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
720720
|-|-|-|-|-|-
721721
| 0055 |[Jump Game](src/main/java/g0001_0100/s0055_jump_game/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 2 | 79.47
722-
| 0045 |[Jump Game II](src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) |2 |49.02
722+
| 0045 |[Jump Game II](src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) |0 |100.00
723723

724724
####Day 5
725725

@@ -1522,8 +1522,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.37'
15221522

15231523
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
15241524
|-|-|-|-|-|-
1525-
| 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 |100.00
1526-
| 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 |95.07
1525+
| 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 |99.99
1526+
| 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 |94.08
15271527

15281528
###Udemy
15291529

@@ -1582,7 +1582,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.37'
15821582
| 1291 |[Sequential Digits](src/main/java/g1201_1300/s1291_sequential_digits/Solution.java)| Medium | Enumeration | 0 | 100.00
15831583
| 0448 |[Find All Numbers Disappeared in an Array](src/main/java/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/Solution.java)| Easy | Array, Hash_Table | 3 | 100.00
15841584
| 0442 |[Find All Duplicates in an Array](src/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java)| Medium | Array, Hash_Table | 5 | 98.83
1585-
| 0041 |[First Missing Positive](src/main/java/g0001_0100/s0041_first_missing_positive/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) |2 |57.59
1585+
| 0041 |[First Missing Positive](src/main/java/g0001_0100/s0041_first_missing_positive/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) |1 |100.00
15861586
| 0697 |[Degree of an Array](src/main/java/g0601_0700/s0697_degree_of_an_array/Solution.java)| Easy | Array, Hash_Table | 14 | 93.19
15871587
| 0532 |[K-diff Pairs in an Array](src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java)| Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 13 | 58.23
15881588
| 0713 |[Subarray Product Less Than K](src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java)| Medium | Array, Sliding_Window | 8 | 39.00
@@ -1714,11 +1714,11 @@ implementation 'com.github.javadev:leetcode-in-java:1.37'
17141714
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
17151715
|-|-|-|-|-|-
17161716
| 0022 |[Generate Parentheses](src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00
1717-
| 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 |100.00
1717+
| 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 |99.99
17181718
| 0216 |[Combination Sum III](src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java)| Medium | Array, Backtracking | 1 | 81.35
17191719
| 0078 |[Subsets](src/main/java/g0001_0100/s0078_subsets/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 1 | 70.60
17201720
| 0017 |[Letter Combinations of a Phone Number](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00
1721-
| 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 |95.07
1721+
| 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 |94.08
17221722

17231723
####Udemy Bit Manipulation
17241724

‎src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
44
// #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(2^n)_Space_O(n) #2023_08_09_Time_0_ms_(100.00%)_Space_41.7_MB_(97.17%)
5+
// #Big_O_Time_O(2^n)_Space_O(n) #2024_11_10_Time_0_ms_(100.00%)_Space_42.8_MB_(84.67%)
66

77
importjava.util.ArrayList;
88
importjava.util.List;

‎src/main/java/g0001_0100/s0023_merge_k_sorted_lists/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
44
// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
5-
// #2023_08_09_Time_1_ms_(100.00%)_Space_42.9_MB_(98.59%)
5+
// #2024_11_10_Time_1_ms_(99.86%)_Space_44.1_MB_(79.93%)
66

77
importcom_github_leetcode.ListNode;
88

‎src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_12_Linked_List
44
// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
5-
// #2023_08_09_Time_0_ms_(100.00%)_Space_40.7_MB_(10.83%)
5+
// #2024_11_10_Time_0_ms_(100.00%)_Space_41.4_MB_(20.29%)
66

77
importcom_github_leetcode.ListNode;
88

‎src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
44
// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k)
5-
// #2023_08_09_Time_0_ms_(100.00%)_Space_43_MB_(88.08%)
5+
// #2024_11_10_Time_0_ms_(100.00%)_Space_44.4_MB_(33.90%)
66

77
importcom_github_leetcode.ListNode;
88

‎src/main/java/g0001_0100/s0031_next_permutation/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0001_0100.s0031_next_permutation;
22

33
// #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1)
4-
// #2023_08_09_Time_0_ms_(100.00%)_Space_42_MB_(90.28%)
4+
// #2024_11_10_Time_0_ms_(100.00%)_Space_43_MB_(39.33%)
55

66
publicclassSolution {
77
publicvoidnextPermutation(int[]nums) {

‎src/main/java/g0001_0100/s0032_longest_valid_parentheses/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0001_0100.s0032_longest_valid_parentheses;
22

33
// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1)
4-
// #2023_08_09_Time_1_ms_(100.00%)_Space_41.4_MB_(85.22%)
4+
// #2024_11_10_Time_1_ms_(99.74%)_Space_42.2_MB_(80.93%)
55

66
publicclassSolution {
77
publicintlongestValidParentheses(Strings) {

‎src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search
55
// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
6-
// #2023_08_09_Time_0_ms_(100.00%)_Space_40.6_MB_(92.43%)
6+
// #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(21.10%)
77

88
publicclassSolution {
99
publicintsearch(int[]nums,inttarget) {

‎src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1)
5-
// #2023_08_09_Time_0_ms_(100.00%)_Space_44.3_MB_(89.57%)
5+
// #2024_11_10_Time_0_ms_(100.00%)_Space_45.7_MB_(82.78%)
66

77
publicclassSolution {
88
publicint[]searchRange(int[]nums,inttarget) {

‎src/main/java/g0001_0100/s0035_search_insert_position/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
44
// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1)
5-
// #2023_08_09_Time_0_ms_(100.00%)_Space_43.3_MB_(58.21%)
5+
// #2024_11_10_Time_0_ms_(100.00%)_Space_43_MB_(40.42%)
66

77
publicclassSolution {
88
publicintsearchInsert(int[]nums,inttarget) {

‎src/main/java/g0001_0100/s0039_combination_sum/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking
44
// #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2023_08_09_Time_1_ms_(100.00%)_Space_43.6_MB_(90.84%)
5+
// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_11_10_Time_1_ms_(99.99%)_Space_44.5_MB_(51.73%)
66

77
importjava.util.ArrayList;
88
importjava.util.List;
Lines changed: 5 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -1,15 +1,16 @@
11
packageg0001_0100.s0041_first_missing_positive;
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays
4-
// #Big_O_Time_O(n)_Space_O(n) #2023_08_11_Time_2_ms_(57.59%)_Space_59.2_MB_(51.48%)
4+
// #Big_O_Time_O(n)_Space_O(n) #2024_11_10_Time_1_ms_(100.00%)_Space_57.5_MB_(31.18%)
55

66
publicclassSolution {
77
publicintfirstMissingPositive(int[]nums) {
88
for (inti =0;i <nums.length;i++) {
9-
if (nums[i] <=0 ||nums[i] >nums.length ||nums[i] ==i +1) {
10-
continue;
9+
while (nums[i] <=nums.length &&nums[i] >0 &&nums[nums[i] -1] !=nums[i]) {
10+
inttemp =nums[nums[i] -1];
11+
nums[nums[i] -1] =nums[i];
12+
nums[i] =temp;
1113
}
12-
dfs(nums,nums[i]);
1314
}
1415
for (inti =0;i <nums.length;i++) {
1516
if (nums[i] !=i +1) {
@@ -18,13 +19,4 @@ public int firstMissingPositive(int[] nums) {
1819
}
1920
returnnums.length +1;
2021
}
21-
22-
privatevoiddfs(int[]nums,intval) {
23-
if (val <=0 ||val >nums.length ||val ==nums[val -1]) {
24-
return;
25-
}
26-
inttemp =nums[val -1];
27-
nums[val -1] =val;
28-
dfs(nums,temp);
29-
}
3022
}

‎src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Two_Pointers
44
// #Stack #Monotonic_Stack #Dynamic_Programming_I_Day_9 #Udemy_Two_Pointers
5-
// #Big_O_Time_O(n)_Space_O(1) #2023_08_11_Time_0_ms_(100.00%)_Space_44.3_MB_(62.40%)
5+
// #Big_O_Time_O(n)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_46.2_MB_(57.86%)
66

77
publicclassSolution {
88
publicinttrap(int[]height) {

‎src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java

Lines changed: 20 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -2,25 +2,29 @@
22

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
5-
// #Big_O_Time_O(n)_Space_O(1) #2023_08_11_Time_2_ms_(49.02%)_Space_44.7_MB_(52.72%)
5+
// #Big_O_Time_O(n)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_45_MB_(64.44%)
66

77
publicclassSolution {
8+
privateintgetMax(int[]nums,intl,intr) {
9+
intmax = -1;
10+
intcurr = -1;
11+
for (inti =l;i <=r;i++) {
12+
curr =i +nums[i];
13+
max =Math.max(max,curr);
14+
}
15+
returnmax;
16+
}
17+
818
publicintjump(int[]nums) {
9-
intlength =0;
10-
intmaxLength =0;
11-
intminJump =0;
12-
for (inti =0;i <nums.length -1; ++i) {
13-
length--;
14-
maxLength--;
15-
maxLength =Math.max(maxLength,nums[i]);
16-
if (length <=0) {
17-
length =maxLength;
18-
minJump++;
19-
}
20-
if (length >=nums.length -i -1) {
21-
returnminJump;
22-
}
19+
intl =0;
20+
intr =0;
21+
intjumps =0;
22+
while (r <nums.length -1) {
23+
intprev =r;
24+
r =getMax(nums,l,r);
25+
l =prev +1;
26+
jumps++;
2327
}
24-
returnminJump;
28+
returnjumps;
2529
}
2630
}

‎src/main/java/g0001_0100/s0046_permutations/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
44
// #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
55
// #Udemy_Backtracking/Recursion #Big_O_Time_O(n*n!)_Space_O(n+n!)
6-
// #2023_08_11_Time_1_ms_(95.07%)_Space_43.7_MB_(87.98%)
6+
// #2024_11_10_Time_1_ms_(94.08%)_Space_45.1_MB_(6.84%)
77

88
importjava.util.ArrayList;
99
importjava.util.List;

‎src/main/java/g0001_0100/s0048_rotate_image/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Matrix
44
// #Data_Structure_II_Day_3_Array #Programming_Skills_II_Day_7 #Udemy_2D_Arrays/Matrix
5-
// #Big_O_Time_O(n^2)_Space_O(1) #2023_08_11_Time_0_ms_(100.00%)_Space_41.5_MB_(34.96%)
5+
// #Big_O_Time_O(n^2)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(43.71%)
66

77
publicclassSolution {
88
publicvoidrotate(int[][]matrix) {

0 commit comments

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