一、具体实现方法
/**
* 将一个list按照新的步长分成list长度/step_length 向上取整个小list
* @param list
* @param step_length
* @return
*/
public static List<String> GetCyclicAcquisition(List<Integer> list,int step_length) {
List<String> result_list = new ArrayList<>();
int ceil = (int)Math.ceil(list.size() / step_length);
for (int i = 0;i < ceil;i++){
List<Integer> limit = list.stream().skip(step_length * i).limit(step_length).collect(Collectors.toList());
System.out.println(limit);
}
return result_list;
}
二、方法测试
public static void main(String[] args) { List<Integer> list = new ArrayList<>(); for (int i = 0; i < 100; i++) { list.add(i); } GetCyclicAcquisition(list,10); }
输出如下:
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9] [10, 11, 12, 13, 14, 15, 16, 17, 18, 19] [20, 21, 22, 23, 24, 25, 26, 27, 28, 29] [30, 31, 32, 33, 34, 35, 36, 37, 38, 39] [40, 41, 42, 43, 44, 45, 46, 47, 48, 49] [50, 51, 52, 53, 54, 55, 56, 57, 58, 59] [60, 61, 62, 63, 64, 65, 66, 67, 68, 69] [70, 71, 72, 73, 74, 75, 76, 77, 78, 79] [80, 81, 82, 83, 84, 85, 86, 87, 88, 89] [90, 91, 92, 93, 94, 95, 96, 97, 98, 99]标签:int,list,List,step,ceil,length From: https://www.cnblogs.com/songweipeng/p/16581828.html