集合拆分

 

//入参 list 集合  len  拆分的集合大小  返回一个list集合

 

public <T> List<List<T>> splitList(List<T> list, int len) {

        if (list == null || list.size() == 0 || len < 1) {
            return null;
        }

        List<List<T>> result = new ArrayList<List<T>>();
        int size = list.size();
        int count = (size + len - 1) / len;

        for (int i = 0; i < count; i++) {
            List<T> subList = list.subList(i * len, ((i + 1) * len > size ? size : len * (i + 1)));
            result.add(subList);
        }
        return result;
    }

后续更新 Java8特性切割集合

package com.integral.test;

import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.Stream;

/**
 * @oauth: qiangSW
 * @date: 2019/9/3 14:38
 * @description: com.integral.test
 * @doc: java 8 集合拆分
 */
public class ReadFile {

    public static void main(String[] args) {
        String path = "C:\\Users\\YangTG\\Desktop\\eventInst1.txt";
        List<List<String>> lists = new ArrayList<>();
        int maxNum = 10000;
        try {
            List<String> list = Files.lines(Paths.get(path)).collect(Collectors.toList());


            System.out.println("读取的文件总行数"+list.size());
            int count = countStep(list.size(), maxNum);
            System.out.println("集合切割的长度"+count);
            Stream.iterate(0, f -> f + 1).limit(count).parallel().forEach(a -> {
                try {
                    // skip跳过的行数  limit最大行数
                    lists.add(list.stream().skip(a * maxNum).limit(maxNum).collect(Collectors.toList()));
                } catch (Exception e) {
                    e.printStackTrace();
                }

            });
            System.out.println("切割后的集合长度:"+lists.size());
        } catch (Exception e) {
            e.printStackTrace();
        }

    }

    /**
     * 集合拆分
     *
     * @param listSize 集合长度
     * @param size     每个集合长度
     * @return
     */
    public static int countStep(int listSize, int size) {
        int count = listSize / size;
        return listSize % size == 0 ? count : count + 1;
    }
}

控制台打印 

读取的文件总行数634247
集合切割的长度64
切割后的集合长度:64

Process finished with exit code 0