Leetcode 624 Maximum Distance in Arrays

最新推荐文章于 2025-04-21 22:09:55 发布

哀酱

最新推荐文章于 2025-04-21 22:09:55 发布

阅读量433

点赞数

分类专栏： LeetCode(c++&python) 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/u010821666/article/details/74066768

版权

LeetCode(c++&python) 专栏收录该内容

136 篇文章

订阅专栏

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;

    }
};