LeetCode 3423. Maximum Difference Between Adjacent Elements in a Circular Array

🔗  leetcode.com/problems/ma…

题目

• 给一个循环数组 num
• 返回相邻两个数字 absolute difference 的最大值

思路

• 遍历相邻两个数组的 absolute difference，记录最大值，处理一下 circular 的边界

代码

class Solution {
public:
    int abs(int num) {
        if (num < 0) return -num;
        return num;
    }
    int maxAdjacentDistance(vector<int>& nums) {
        int ans = abs(*(nums.end() - 1) - nums[0]);
        for (int i = 0; i < nums.size() - 1; i++) {
            ans = max(ans, abs(nums[i] - nums[i+1]));
        }
        return ans;
    }
};