diff options
| author | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
| commit | d8f3b40085619cb680c8f227c65a1f5acc393223 (patch) | |
| tree | 6a38e3a6c79276fc396259ef962d17236dbed569 /leetcode/cpp/976.cpp | |
| parent | b0162802ad9723c678e495f29ca2f0fc0af2eff1 (diff) | |
| download | solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.tar.gz solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.tar.bz2 solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.zip | |
Move leetcode solutions to subdir.
Diffstat (limited to 'leetcode/cpp/976.cpp')
| -rw-r--r-- | leetcode/cpp/976.cpp | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/leetcode/cpp/976.cpp b/leetcode/cpp/976.cpp new file mode 100644 index 0000000..e306047 --- /dev/null +++ b/leetcode/cpp/976.cpp @@ -0,0 +1,23 @@ +#include <vector>
+
+using std::vector;
+
+#include <algorithm>
+#include <functional>
+
+class Solution
+{
+public:
+ int largestPerimeter(vector<int> &A)
+ {
+ std::sort(A.begin(), A.end(), std::greater<int>{});
+ for (int i = 0; i < A.size() - 2; i++)
+ {
+ if (A[i] < A[i + 1] + A[i + 2])
+ {
+ return A[i] + A[i + 1] + A[i + 2];
+ }
+ }
+ return 0;
+ }
+};
|