From 4ada2a99189b5fb1f752992116c77179ef92fa1f Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Thu, 12 Jun 2025 01:13:00 -0600 Subject: 3423. maximum difference between adjacent elements in a circular queue --- max_diff_between_adj_elem.c | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 max_diff_between_adj_elem.c (limited to 'max_diff_between_adj_elem.c') diff --git a/max_diff_between_adj_elem.c b/max_diff_between_adj_elem.c new file mode 100644 index 0000000..a96f02c --- /dev/null +++ b/max_diff_between_adj_elem.c @@ -0,0 +1,23 @@ +// 3423. Maximum Difference Between Adjacent Elements in a Circular Array +#include "leetcode.h" + +/* + * given a circular array 'nums', find the maximum absolute difference between + * adjacent elements. note, in a circular array, the first and last elements are + * adjacent. + */ + +int maxAdjacentDistance(int *nums, int numsSize) { + int ans = abs(nums[0] - nums[numsSize - 1]); + for (int i = 1; i < numsSize; i++) { + int curr = abs(nums[i - 1] - nums[i]); + ans = fmax(ans, curr); + } + return ans; +} + +int main() { + int n1[] = {1, 2, 4}, n2[] = {-5, -10, -5}; + printf("%d\n", maxAdjacentDistance(n1, ARRAY_SIZE(n2))); // expect: 3 + printf("%d\n", maxAdjacentDistance(n1, ARRAY_SIZE(n2))); // expect: 5 +} -- cgit v1.2.3