-
[Day11] 830. Positions of Large Groups@StudY/.algorithm 2019. 3. 4. 16:05
830. Positions of Large Groups
class Solution {
public List<List<Integer>> largeGroupPositions(String S) {
S = S+"\0";
List<List<Integer>> positions = new ArrayList<List<Integer>>();
int largest=1;
if (S.length()==0) return positions;
for (int i=0; i<S.length()-1; i++) {
if (S.charAt(i) != S.charAt(i+1)) {
if (largest >= 3) {
List<Integer> largeGroup = new ArrayList();
largeGroup.add(i-(largest-1));
largeGroup.add(i);
positions.add(largeGroup);
}
largest=1;
} else { largest++; }
}
return positions;
}
}
Accepted 6 ms 39.9 MB java Runtime: 6 ms, faster than 100.00% of Java online submissions for Positions of Large Groups.Memory Usage: 39.9 MB, less than 38.61% of Java online submissions forPositions of Large Groups.'@StudY > .algorithm' 카테고리의 다른 글
[Day12] 15. 3Sum (0) 2019.03.06 [Day10] 430. Flatten a Multilevel Doubly Linked List (0) 2019.02.28 [Day8/9] 409. Longest Palindrome (0) 2019.02.26 [Day7] 876. Middle of the Linked List / 86. Partition List (LeetCode) (0) 2019.02.22 [Day6] 981. Time Based Key-Value Store (0) 2019.02.20