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 214984e

Browse files
New solved problems
1 parent ee0b6b9 commit 214984e

File tree

55 files changed

+3621
-5
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

55 files changed

+3621
-5
lines changed

‎README.md

Lines changed: 45 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -59,6 +59,10 @@ My accepted leetcode solutions to some of the common interview problems.
5959
- [Maximum Sum of Two Non-Overlapping Subarrays](problems/src/array/MaximumSumofTwoNonOverlappingSubarrays.java) (Medium)
6060
- [Longest Line of Consecutive One in Matrix](problems/src/array/LongestLineofConsecutiveOneinMatrix.java) (Medium)
6161
- [Array Partition I](problems/src/array/ArrayPartitionI.java) (Easy)
62+
- [Relative Sort Array](problems/src/array/RelativeSortArray.java) (Easy)
63+
- [Meeting Scheduler](problems/src/array/MeetingScheduler.java) (Medium)
64+
- [Minimum Swaps to Group All 1's Together](problems/src/array/MinimumSwapsToGroupAll1Together.java) (Medium)
65+
- [Array Nesting](problems/src/array/ArrayNesting.java) (Medium)
6266

6367
#### [Backtracking](problems/src/backtracking)
6468

@@ -98,6 +102,7 @@ My accepted leetcode solutions to some of the common interview problems.
98102
- [Time Based Key-Value Store](problems/src/binary_search/TimeBasedKeyValuePair.java) (Medium)
99103
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Window Subsequence](problems/src/binary_search/MinimumWindowSubsequence.java) (Hard)
100104
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Koko Eating Bananas](problems/src/binary_search/KokoEatingBananas.java) (Hard)
105+
- [Single Element in a Sorted Array](problems/src/binary_search/SingleElementInASortedArray.java) (Medium)
101106

102107
#### [Bit Manipulation](problems/src/bit_manipulation)
103108

@@ -106,6 +111,7 @@ My accepted leetcode solutions to some of the common interview problems.
106111
- [Total Hamming Distance](problems/src/bit_manipulation/TotalHammingDistance.java) (Medium)
107112
- [Divide Two Integers](problems/src/bit_manipulation/DivideTwoIntegers.java) (Medium)
108113
- [Binary Number with Alternating Bits](problems/src/bit_manipulation/BinaryNumberWithAlternatingBits.java) (Easy)
114+
- [Binary Watch](problems/src/bit_manipulation/BinaryWatch.java) (Easy)
109115

110116
#### [Breadth First Search](problems/src/breadth_first_search)
111117

@@ -119,6 +125,7 @@ My accepted leetcode solutions to some of the common interview problems.
119125
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Bus Routes](problems/src/breadth_first_search/BusRoutes.java) (Hard)
120126
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Sliding Puzzle](problems/src/breadth_first_search/SlidingPuzzle.java) (Hard)
121127
- [Matrix](problems/src/breadth_first_search/Matrix.java) (Medium)
128+
- [Rotting Oranges](problems/src/breadth_first_search/RottingOranges.java) (Medium)
122129

123130
#### [Depth First Search](problems/src/depth_first_search)
124131

@@ -145,6 +152,9 @@ My accepted leetcode solutions to some of the common interview problems.
145152
- [Number of Enclaves](problems/src/depth_first_search/NumberOfEnclaves.java) (Medium)
146153
- [As Far from Land as Possible](problems/src/depth_first_search/AsFarfromLandAsPossible.java) (Medium)
147154
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimize Malware Spread](problems/src/depth_first_search/MinimizeMalwareSpread.java) (Hard)
155+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Parallel Courses](problems/src/depth_first_search/ParallelCourses.java) (Hard)
156+
- [Connecting Cities With Minimum Cost](problems/src/depth_first_search/ConnectingCitiesWithMinimumCost.java) (Medium)
157+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Critical Connections in a Network](problems/src/depth_first_search/CriticalConnection.java) (Hard)
148158

149159
#### [Design](problems/src/design)
150160

@@ -172,6 +182,7 @@ My accepted leetcode solutions to some of the common interview problems.
172182
- [Search in a 2D Matrix](problems/src/divide_and_conquer/SearchA2DMatrix.java) (Medium)
173183
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [24 Game](problems/src/divide_and_conquer/TwentyFourGame.java) (Hard)
174184
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Reverse Pairs II](problems/src/divide_and_conquer/ReversePairsII.java) (Hard)
185+
- [My Calendar II](problems/src/divide_and_conquer/MyCalendarII.java) (Medium)
175186

176187
#### [Dynamic Programming](problems/src/dynamic_programming)
177188

@@ -229,7 +240,32 @@ My accepted leetcode solutions to some of the common interview problems.
229240
- [Ones and Zeroes](problems/src/dynamic_programming/OnesAndZeroes.java) (Medium)
230241
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Encode String with Shortest Length](problems/src/dynamic_programming/EncodeStringWithShortestLength.java) (Hard)
231242
- [Length of Longest Fibonacci Subsequence](problems/src/dynamic_programming/LengthofLongestFibonacciSubsequence.java) (Medium)
232-
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Encode String with Shortest Length](problems/src/dynamic_programming/EncodeStringWithShortestLength.java) (Hard)
243+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Make Array Strictly Increasing](problems/src/dynamic_programming/MakeArrayStrictlyIncreasing.java) (Hard)
244+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Number of Taps to Open to Water a Garden](problems/src/dynamic_programming/MinimumNumberOfTaps.java) (Hard)
245+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Delete Columns to Make Sorted III](problems/src/dynamic_programming/DeleteColumnsToMakeSortedIII.java) (Hard)
246+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Handshakes That Don't Cross](problems/src/dynamic_programming/HandshakesThatDontCross.java) (Hard)
247+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Difficulty of a Job Schedule](problems/src/dynamic_programming/MinimumDifficultyOfAJobSchedule.java) (Hard)
248+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Jump Game V](problems/src/dynamic_programming/JumpGameV.java) (Hard)
249+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Freedom Trail](problems/src/dynamic_programming/FreedomTrail.java) (Hard)
250+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Strange Printer](problems/src/dynamic_programming/StrangePrinter.java) (Hard)
251+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Cost to Merge Stones](problems/src/dynamic_programming/MinimumCostToMergeStones.java) (Hard)
252+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Interleaving String](problems/src/dynamic_programming/InterleavingString.java) (Hard)
253+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Count Vowels Permutation](problems/src/dynamic_programming/CountVowelsPermutation.java) (Hard)
254+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Non-negative Integers without Consecutive Ones](problems/src/dynamic_programming/NonNegativeIntegersWithoutConsecutiveOnes.java) (Hard)
255+
- [Bomb Enemy](problems/src/dynamic_programming/BombEnemy.java) (Medium)
256+
- [Number of Dice Rolls With Target Sum](problems/src/dynamic_programming/NumberOfDiceRollsWithTargetSum.java) (Medium)
257+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Distinct Subsequences](problems/src/dynamic_programming/DistinctSubsequences.java) (Hard)
258+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Distinct Subsequences II](problems/src/dynamic_programming/DistinctSubsequencesII.java) (Hard)
259+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Distance to Type a Word Using Two Fingers](problems/src/dynamic_programming/MinimumDistanceToTypeAWordUsingTwoFingers.java) (Hard)
260+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Valid Palindrome III](problems/src/dynamic_programming/ValidPalindromeIII.java) (Hard)
261+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Palindrome Partitioning III](problems/src/dynamic_programming/PalindromePartitioningIII.java) (Hard)
262+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Tiling a Rectangle with the Fewest Squares](problems/src/dynamic_programming/TilingARectangle.java) (Hard)
263+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Longest Chunked Palindrome Decomposition](problems/src/dynamic_programming/LongestChunkedPalindromeDecomposition.java) (Hard)
264+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Stone Game III](problems/src/dynamic_programming/StoneGameIII.java) (Hard)
265+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Number of Ways to Stay in the Same Place After Some Steps](problems/src/dynamic_programming/NumberOfWaysToStayInTheSamePlace.java) (Hard)
266+
- [Toss Strange Coins](problems/src/dynamic_programming/TossStrangeCoins.java) (Medium)
267+
- [Knight Dialer](problems/src/dynamic_programming/KnightDialer.java) (Medium)
268+
233269

234270
#### [Greedy](problems/src/greedy)
235271

@@ -249,6 +285,7 @@ My accepted leetcode solutions to some of the common interview problems.
249285
- [Boats to Save People](problems/src/greedy/BoatsToSavePeople.java) (Medium)
250286
- [Broken Calculator](problems/src/greedy/BrokenCalculator.java) (Medium)
251287
- [Two City Scheduling](problems/src/greedy/TwoCityScheduling.java) (Easy)
288+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Time to Build Blocks](problems/src/greedy/MinimumTimeToBuildBlocks.java) (Hard)
252289

253290
#### [Hashing](problems/src/hashing)
254291

@@ -268,6 +305,8 @@ My accepted leetcode solutions to some of the common interview problems.
268305
- [Distribute Candies](problems/src/hashing/DistributeCandies.java) (Easy)
269306
- [Groups of Special-Equivalent Strings](problems/src/hashing/GroupsOfSpecialEquivalentStrings.java) (Easy)
270307
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Number of Atoms](problems/src/hashing/NumberOfAtoms.java) (Hard)
308+
- [Analyze User Website Visit Pattern](problems/src/hashing/AnalyzeUserWebsiteVisitPattern.java) (Medium)
309+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [String Transforms Into Another String](problems/src/hashing/StringTransformsIntoAnotherString.java) (Hard)
271310

272311
#### [Heap](problems/src/heap)
273312

@@ -279,6 +318,8 @@ My accepted leetcode solutions to some of the common interview problems.
279318
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Smallest Rotation with Highest Score](problems/src/heap/SmallestRotationWithHighestScore.java) (Hard)
280319
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Maximum Frequency Stack](problems/src/heap/FreqStack.java) (Hard)
281320
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Reachable Nodes In Subdivided Graph](problems/src/heap/ReachableNodesInSubdividedGraph.java) (Hard)
321+
- [K Closest Points to Origin](problems/src/heap/KClosestPointsToOrigin.java) (Medium)
322+
- [Distant Barcodes](problems/src/heap/DistantBarcodes.java) (Medium)
282323

283324
#### [Linked List](problems/src/linked_list)
284325

@@ -316,6 +357,9 @@ My accepted leetcode solutions to some of the common interview problems.
316357
- [Base 7](problems/src/math/Base7.java) (Easy)
317358
- [Smallest Range I](problems/src/math/SmallestRangeI.java) (Easy)
318359
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Largest Component Size by Common Factor](problems/src/math/LargestComponentSizebyCommonFactor.java) (Hard)
360+
- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Super Washing Machines](problems/src/math/SuperWashingMachines.java) (Hard)
361+
- [Rectangle Overlap](problems/src/math/RectangleOverlap.java) (Easy)
362+
- [Nth Digit](problems/src/math/NthDigit.java) (Easy)
319363

320364
#### [Reservoir Sampling](problems/src/reservoir_sampling)
321365

‎problems/src/array/ArrayNesting.java

Lines changed: 56 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,56 @@
1+
package array;
2+
3+
import java.util.*;
4+
5+
/**
6+
* Created by gouthamvidyapradhan on 09/10/2019 A zero-indexed array A of length N contains all
7+
* integers from 0 to N-1. Find and return the longest length of set S, where S[i] = {A[i], A[A[i]],
8+
* A[A[A[i]]], ... } subjected to the rule below.
9+
*
10+
* <p>Suppose the first element in S starts with the selection of element A[i] of index = i, the
11+
* next element in S should be A[A[i]], and then A[A[A[i]]]... By that analogy, we stop adding right
12+
* before a duplicate element occurs in S.
13+
*
14+
* <p>Example 1:
15+
*
16+
* <p>Input: A = [5,4,0,3,1,6,2] Output: 4 Explanation: A[0] = 5, A[1] = 4, A[2] = 0, A[3] = 3, A[4]
17+
* = 1, A[5] = 6, A[6] = 2.
18+
*
19+
* <p>One of the longest S[K]: S[0] = {A[0], A[5], A[6], A[2]} = {5, 6, 2, 0}
20+
*
21+
* <p>Note:
22+
*
23+
* <p>N is an integer within the range [1, 20,000]. The elements of A are all distinct. Each element
24+
* of A is an integer within the range [0, N-1].
25+
*/
26+
public class ArrayNesting {
27+
public static void main(String[] args) {
28+
int[] A = {5, 4, 0, 3, 1, 6, 2};
29+
System.out.println(new ArrayNesting().arrayNesting(A));
30+
}
31+
32+
Set<Integer> done;
33+
int count;
34+
35+
public int arrayNesting(int[] nums) {
36+
done = new HashSet<>();
37+
int max = 0;
38+
for (int i = 0; i < nums.length; i++) {
39+
if (!done.contains(i)) {
40+
count = 0;
41+
dfs(i, nums);
42+
max = Math.max(max, count);
43+
}
44+
}
45+
return max;
46+
}
47+
48+
private void dfs(int i, int[] nums) {
49+
done.add(i);
50+
count++;
51+
int n = nums[i];
52+
if (!done.contains(n)) {
53+
dfs(n, nums);
54+
}
55+
}
56+
}
Lines changed: 86 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,86 @@
1+
package array;
2+
3+
import java.util.*;
4+
5+
/**
6+
* Created by gouthamvidyapradhan on 19/11/2019 Given the availability time slots arrays slots1 and
7+
* slots2 of two people and a meeting duration duration, return the earliest time slot that works
8+
* for both of them and is of duration duration.
9+
*
10+
* <p>If there is no common time slot that satisfies the requirements, return an empty array.
11+
*
12+
* <p>The format of a time slot is an array of two elements [start, end] representing an inclusive
13+
* time range from start to end.
14+
*
15+
* <p>It is guaranteed that no two availability slots of the same person intersect with each other.
16+
* That is, for any two time slots [start1, end1] and [start2, end2] of the same person, either
17+
* start1 > end2 or start2 > end1.
18+
*
19+
* <p>Example 1:
20+
*
21+
* <p>Input: slots1 = [[10,50],[60,120],[140,210]], slots2 = [[0,15],[60,70]], duration = 8 Output:
22+
* [60,68] Example 2:
23+
*
24+
* <p>Input: slots1 = [[10,50],[60,120],[140,210]], slots2 = [[0,15],[60,70]], duration = 12 Output:
25+
* []
26+
*
27+
* <p>Constraints:
28+
*
29+
* <p>1 <= slots1.length, slots2.length <= 10^4 slots1[i].length, slots2[i].length == 2 slots1[i][0]
30+
* < slots1[i][1] slots2[i][0] < slots2[i][1] 0 <= slots1[i][j], slots2[i][j] <= 10^9 1 <= duration
31+
* <= 10^6
32+
*/
33+
public class MeetingScheduler {
34+
public static void main(String[] args) {
35+
int[][] slots1 = {{10, 50}, {60, 120}, {140, 210}};
36+
int[][] slots2 = {{0, 15}, {60, 70}};
37+
List<Integer> result = new MeetingScheduler().minAvailableDuration(slots1, slots2, 12);
38+
System.out.println();
39+
}
40+
41+
private class Node {
42+
int s, e, type;
43+
44+
Node(int s, int e, int type) {
45+
this.s = s;
46+
this.e = e;
47+
this.type = type;
48+
}
49+
}
50+
51+
public List<Integer> minAvailableDuration(int[][] slots1, int[][] slots2, int duration) {
52+
PriorityQueue<Node> pq =
53+
new PriorityQueue<>(
54+
(o1, o2) -> {
55+
int r = Integer.compare(o1.s, o2.s);
56+
if (r == 0) {
57+
return Integer.compare(o1.e, o2.e);
58+
} else return r;
59+
});
60+
for (int[] s : slots1) {
61+
pq.offer(new Node(s[0], s[1], 1));
62+
}
63+
for (int[] s : slots2) {
64+
pq.offer(new Node(s[0], s[1], 2));
65+
}
66+
Node prev = null;
67+
while (!pq.isEmpty()) {
68+
Node node = pq.poll();
69+
if (prev == null) {
70+
prev = node;
71+
} else {
72+
if (prev.type != node.type) {
73+
int s = Math.max(prev.s, node.s);
74+
int e = Math.min(prev.e, node.e);
75+
if ((e - s) >= duration) {
76+
return Arrays.asList(s, s + duration);
77+
}
78+
}
79+
if (node.e > prev.e) {
80+
prev = node;
81+
}
82+
}
83+
}
84+
return new ArrayList<>();
85+
}
86+
}
Lines changed: 61 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,61 @@
1+
package array;
2+
3+
import java.util.*;
4+
5+
/**
6+
* Created by gouthamvidyapradhan on 23/10/2019 Given a binary array data, return the minimum number
7+
* of swaps required to group all 1’s present in the array together in any place in the array.
8+
*
9+
* <p>Example 1:
10+
*
11+
* <p>Input: [1,0,1,0,1] Output: 1 Explanation: There are 3 ways to group all 1's together:
12+
* [1,1,1,0,0] using 1 swap. [0,1,1,1,0] using 2 swaps. [0,0,1,1,1] using 1 swap. The minimum is 1.
13+
* Example 2:
14+
*
15+
* <p>Input: [0,0,0,1,0] Output: 0 Explanation: Since there is only one 1 in the array, no swaps
16+
* needed. Example 3:
17+
*
18+
* <p>Input: [1,0,1,0,1,0,0,1,1,0,1] Output: 3 Explanation: One possible solution that uses 3 swaps
19+
* is [0,0,0,0,0,1,1,1,1,1,1]. Solution: O(N) All the 1s to be grouped together would mean that all
20+
* 1s should occupy a small window in a array, this window could be in any part of the array - a
21+
* window with minimum number of 0s is the minimum number of swap required.
22+
*/
23+
public class MinimumSwapsToGroupAll1Together {
24+
public static void main(String[] args) {
25+
//
26+
}
27+
28+
public int minSwaps(int[] data) {
29+
int one = 0;
30+
int zero = 0;
31+
for (int i = 0; i < data.length; i++) {
32+
if (data[i] == 1) {
33+
one++;
34+
} else zero++;
35+
}
36+
if (one == 0) return 0;
37+
int window = one;
38+
one = 0;
39+
zero = 0;
40+
int i = 0, j = window - 1;
41+
for (int k = i; k <= j; k++) {
42+
if (data[k] == 1) {
43+
one++;
44+
} else zero++;
45+
}
46+
i++;
47+
j++;
48+
int min = zero;
49+
for (; j < data.length; i++, j++) {
50+
if (data[j] == 0) {
51+
zero++;
52+
} else one++;
53+
54+
if (data[i - 1] == 0) {
55+
zero--;
56+
} else one--;
57+
min = Math.min(min, zero);
58+
}
59+
return min;
60+
}
61+
}
Lines changed: 60 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,60 @@
1+
package array;
2+
3+
import java.util.*;
4+
5+
/**
6+
* Created by gouthamvidyapradhan on 05/12/2019 Given two arrays arr1 and arr2, the elements of arr2
7+
* are distinct, and all elements in arr2 are also in arr1.
8+
*
9+
* <p>Sort the elements of arr1 such that the relative ordering of items in arr1 are the same as in
10+
* arr2. Elements that don't appear in arr2 should be placed at the end of arr1 in ascending order.
11+
*
12+
* <p>Example 1:
13+
*
14+
* <p>Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6] Output: [2,2,2,1,4,3,3,9,6,7,19]
15+
*
16+
* <p>Constraints:
17+
*
18+
* <p>arr1.length, arr2.length <= 1000 0 <= arr1[i], arr2[i] <= 1000 Each arr2[i] is distinct. Each
19+
* arr2[i] is in arr1.
20+
*/
21+
public class RelativeSortArray {
22+
public static void main(String[] args) {
23+
//
24+
}
25+
26+
public int[] relativeSortArray(int[] arr1, int[] arr2) {
27+
List<Integer> notPresent = new ArrayList<>();
28+
Map<Integer, Integer> map = new HashMap<>();
29+
Set<Integer> set = new HashSet<>();
30+
for (int i : arr2) {
31+
set.add(i);
32+
}
33+
for (int i : arr1) {
34+
map.putIfAbsent(i, 0);
35+
map.put(i, map.get(i) + 1);
36+
}
37+
List<Integer> result = new ArrayList<>();
38+
for (int i : arr2) {
39+
int count = map.get(i);
40+
for (int j = 0; j < count; j++) {
41+
result.add(i);
42+
}
43+
}
44+
for (int k : map.keySet()) {
45+
if (!set.contains(k)) {
46+
int count = map.get(k);
47+
for (int i = 0; i < count; i++) {
48+
notPresent.add(k);
49+
}
50+
}
51+
}
52+
notPresent.sort(Comparator.comparingInt(o -> o));
53+
result.addAll(notPresent);
54+
int[] resA = new int[result.size()];
55+
for (int i = 0; i < result.size(); i++) {
56+
resA[i] = result.get(i);
57+
}
58+
return resA;
59+
}
60+
}

0 commit comments

Comments
(0)

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