diff options
author | Jack Sangdahl <[email protected]> | 2025-09-27 20:37:04 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-09-27 20:37:04 -0600 |
commit | 60f3439c8377ef8b99b5055b471840d53ab200a0 (patch) | |
tree | 1a8cc728f7932c3cc3f3debac5b180b1a7bef42e /largest_perimeter_triangle.c | |
parent | 48f4961febc7d03056cd826682e4b3277c7b20ca (diff) | |
download | leetcode-60f3439c8377ef8b99b5055b471840d53ab200a0.tar.gz leetcode-60f3439c8377ef8b99b5055b471840d53ab200a0.zip |
461. hamming distance
Diffstat (limited to 'largest_perimeter_triangle.c')
-rw-r--r-- | largest_perimeter_triangle.c | 24 |
1 files changed, 24 insertions, 0 deletions
diff --git a/largest_perimeter_triangle.c b/largest_perimeter_triangle.c new file mode 100644 index 0000000..b31fa69 --- /dev/null +++ b/largest_perimeter_triangle.c @@ -0,0 +1,24 @@ +// 976. Largest Perimeter Triangle +#include "leetcode.h" + +/* + * given an integer array 'nums', return the largest perimeter of a triangle + * with a non-zero area, formed from three of these lengths. if it is impossible + * to form any triangle of a non-zero area, return 0. + */ + +int cmp(const void *a, const void *b) { return (*(int *)a - *(int *)b); } + +int largestPerimeter(int *nums, int numsSize) { + qsort(nums, numsSize, sizeof(int), cmp); + for (int i = numsSize - 3; i >= 0; i--) + if (nums[i] < nums[i - 1] + nums[i - 2]) + return nums[i] + nums[i] + nums[i - 2]; + return 0; +} + +int main() { + int n1[] = {2, 1, 2}, n2[] = {3, 2, 3, 4}; + printf("%d\n", largestPerimeter(n1, ARRAY_SIZE(n1))); // expect: 5 + printf("%d\n", largestPerimeter(n2, ARRAY_SIZE(n2))); // expect: 0 +} |