问题描述
给定一个数组序列:
0000000 111111 2222 333333
将此数组分割成几个小数组,每个数组存放的元素一致,即
list1 = [0000000]
list2 = [111111]
list3 = [2222]
list4 = [333333]
代码
首先这个数组必须是已经排序的,并且要考虑数组为空的处理情况
本例采用Java进行编写
class Solution {
public static List<List<Integer>> splitSortedList(List<Integer> list) {
List<List<Integer>> lists = Lists.newArrayList();
int length = list.size();
if(length == 0) {
return lists;
}
int from = 0, to = 1;
for (int i = 0; i < length; ++i) {
if (length == 1 || i == length - 1) {
lists.add(list.subList(from, to));
} else if (list.get(i) == list.get(i + 1)) {
++to;
} else {
lists.add(list.subList(from, to));
from = to++;
}
}
return lists;
}
}