Leetcode 624 Maximum Distance in Arrays

Leetcode 624 Maximum Distance in Arrays

#include <vector>#include <windef.h>//max函数using namespace std;class Solution {public:    int maxDistance(vector<vector<int>>& arrays) {        int distance = 0;        for (int i = 0; i < arrays.size(); i++){            for (int j = 0; j < arrays.size(); j++){                if (arrays[j][arrays[j].size() - 1] - arrays[i][0] > distance && i != j)                    distance = arrays[j][arrays[j].size() - 1] - arrays[i][0];            }        }        return distance;    }};//超级无敌慢……class Solution {public:    int maxDistance(vector<vector<int>>& arrays) {        int minnum = arrays[0][0];        int maxnum = arrays[0].back();        int distance = 0;        for (int i = 1; i < arrays.size(); i++){            distance = max(distance, max(abs(arrays[i][0] - maxnum),abs(arrays[i].back()-minnum)));            minnum = min(minnum, arrays[i][0]);            maxnum = max(maxnum, arrays[i].back());        }        return distance;    }};