看着容易做起来易错的典型题,这种题如果像我这样缺乏经验的人,要么容易想的太复杂,要么就是搞不懂关键点在哪
这个题其实有一个要点:要保证你记录了max和min的值,但是又要保证max和min不会自己与自己比较
我一开始的写法保证了后者,但没有保证前者,会漏用例
而保证这两点,最好的办法就是引进一个res,而且保证其不会在同一个数组内比较。比如一种情况,max和min都在第一个数组中,但是它不满足“跨数组”这个前提
public int maxDistance(List<List<Integer>> arrays) {
List<Integer> first = arrays.get(0);
int min = first.get(0);
int fSize = first.size();
int max = first.get(fSize - 1);
int n = arrays.size();
int res = 0;
for (int i = 1; i < n; ++i) {
List<Integer> item = arrays.get(i);
int m = item.size();
int crrMin = item.get(0);
int crrMax = item.get(m - 1);
res = getmax(crrMax - min, res, max-crrMin);
max = Math.max(crrMax, max);
min = Math.min(crrMin, min);
}
return res;
}
private int getmax(int a, int b, int c) {
int res = a;
res = Math.max(res, b);
res = Math.max(res, c);
return res;
}
官方解法确实总是看着很简练,水平很高。不过其实相当不利于调试,除了写的人以外,外人分析这种写法需要分析半天,个人并不喜欢这种写法
//官方解法
public class Solution {
public int maxDistance(int[][] list) {
int res = 0;
for (int i = 0; i < list.length - 1; i++) {
for (int j = i + 1; j < list.length; j++) {
res = Math.max(res, Math.abs(list[i][0] - list[j][list[j].length - 1]));
res = Math.max(res, Math.abs(list[j][0] - list[i][list[i].length - 1]));
}
}
return res;
}
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/maximum-distance-in-arrays/solution/shu-zu-lie-biao-zhong-de-zui-da-ju-chi-by-leetcode/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
public class Solution {
public int maxDistance(int[][] list) {
int res = 0, min_val = list[0][0], max_val = list[0][list[0].length - 1];
for (int i = 1; i < list.length; i++) {
res = Math.max(res, Math.max(Math.abs(list[i][list[i].length - 1] - min_val), Math.abs(max_val - list[i][0])));
min_val = Math.min(min_val, list[i][0]);
max_val = Math.max(max_val, list[i][list[i].length - 1]);
}
return res;
}
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/maximum-distance-in-arrays/solution/shu-zu-lie-biao-zhong-de-zui-da-ju-chi-by-leetcode/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
自己一开始的做法
public int maxDistance(List<List<Integer>> arrays) {
List<Integer> first = arrays.get(0);
List<Integer> second = arrays.get(1);
int min;
int max;
int fl = first.size() - 1;
int sl = second.size() - 1;
int diff1 = second.get(sl) - first.get(0);
int diff2 = first.get(fl) - second.get(0);
if (diff1 > diff2) {
min = first.get(0);
max = second.get(sl);
} else {
min = second.get(0);
max = first.get(fl);
}
int n = arrays.size();
for (int i = 2; i < n; ++i) {
List<Integer> item = arrays.get(i);
int m = item.size();
int tempMax = item.get(m - 1);
int tempMin = item.get(0);
diff1 = tempMax - min;
diff2 = max - tempMin;
if (diff1 > diff2 && diff1 > max - min) {
max = tempMax;
} else if (diff1 < diff2 && diff2 > max - min) {
min = tempMin;
}
}
return max - min;
}