Advertisement
3423. Maximum Difference Between Adjacent Elements in a Circular Array
UnknownView on LeetCode
Time: O(n)
Space: O(1)
Approach
Scan all adjacent pairs including wrap-around; return max absolute difference.
3423.cs
C#
// Approach: Scan all adjacent pairs including wrap-around; return max absolute difference.
// Time: O(n) Space: O(1)
public class Solution
{
public int MaxAdjacentDistance(int[] nums)
{
int ans = Math.Abs(nums[0] - nums[nums.Length - 1]);
for (int i = 0; i + 1 < nums.Length; ++i)
ans = Math.Max(ans, Math.Abs(nums[i] - nums[i + 1]));
return ans;
}
}Advertisement
Was this solution helpful?