2019-11-05 15:15:26 +08:00
|
|
|
import java.io.IOException;
|
|
|
|
import java.nio.file.Files;
|
|
|
|
import java.nio.file.Path;
|
|
|
|
import java.nio.file.Paths;
|
2020-02-09 19:48:55 +08:00
|
|
|
import java.util.ArrayList;
|
2019-11-05 15:15:26 +08:00
|
|
|
import java.util.List;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @author lvxinran
|
|
|
|
* @date 2019/11/5
|
|
|
|
* @discribe
|
|
|
|
*/
|
|
|
|
public class BIUtil {
|
|
|
|
public static void main(String[] args) {
|
2020-02-09 19:48:55 +08:00
|
|
|
|
|
|
|
System.out.print(randomForOneArray(23,8).toString());
|
|
|
|
|
2019-11-05 15:15:26 +08:00
|
|
|
}
|
2020-02-09 19:48:55 +08:00
|
|
|
/**
|
|
|
|
* 将数组均匀拆分为几份
|
|
|
|
*/
|
|
|
|
public static List<Integer> randomForOneArray(int sum, int split) {
|
|
|
|
List<Integer> result = new ArrayList<>();
|
|
|
|
if (split == 0) {
|
|
|
|
return result;
|
2019-11-05 15:15:26 +08:00
|
|
|
}
|
2020-02-09 19:48:55 +08:00
|
|
|
int remain = sum % split;
|
|
|
|
int out = split - remain;
|
|
|
|
int item = (sum+out) / split;
|
|
|
|
|
|
|
|
for (int i = 0; i < split; i++) {
|
|
|
|
int innerItem = i == 0 ? item-out : item;
|
|
|
|
result.add(innerItem);
|
2019-11-05 15:15:26 +08:00
|
|
|
}
|
2020-02-09 19:48:55 +08:00
|
|
|
return result;
|
2019-11-05 15:15:26 +08:00
|
|
|
}
|
|
|
|
}
|