aboutsummaryrefslogtreecommitdiff
path: root/other/largest_perimeter_triangle.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/largest_perimeter_triangle.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/largest_perimeter_triangle.cpp')
-rw-r--r--other/largest_perimeter_triangle.cpp18
1 files changed, 18 insertions, 0 deletions
diff --git a/other/largest_perimeter_triangle.cpp b/other/largest_perimeter_triangle.cpp
new file mode 100644
index 0000000..64b3682
--- /dev/null
+++ b/other/largest_perimeter_triangle.cpp
@@ -0,0 +1,18 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ int largestPerimeter(vector<int> &nums) {
+ sort(nums.begin(), nums.end());
+ for (int i = nums.size() - 1; i > 1; --i)
+ if (nums[i] < nums[i - 1] + nums[i - 2])
+ return nums[i] + nums[i - 1] + nums[i - 2];
+ return 0;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> nums = {2, 1, 2};
+ cout << obj.largestPerimeter(nums);
+}