Skip to content

← leetcode

Maximum Difference Between Adjacent Elements in a Circular Array

· Easy

LeetCode problem 3423

Just iterate through to find the maximum absolute difference between adjacent elements.

code

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

complexity

  • Time: O(n)
  • Space: O(1)

time taken

  • 1 minute and 8 seconds