public int minTotalDistance(int[][] grid) {
List<Integer> rows = new ArrayList<>();
List<Integer> cols = new ArrayList<>();
int m = grid.length, n = grid[0].length;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
return getDistance(rows, false) + getDistance(cols, true);
public int getDistance(List<Integer> list, boolean isCol) {
// rows这个list本身已经sorted,所以只对cols排序
int start = 0, end = list.size() - 1;
dist += list.get(end) - list.get(start);