aboutsummaryrefslogtreecommitdiff
path: root/max_diff_between_adj_elem.c
diff options
context:
space:
mode:
Diffstat (limited to 'max_diff_between_adj_elem.c')
-rw-r--r--max_diff_between_adj_elem.c23
1 files changed, 23 insertions, 0 deletions
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
+}