标签：Perimeter 976 Triangle return Largest Input than

[LeetCode] 976. Largest Perimeter Triangle (C++)

Easy

Share
Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3 of these lengths.

If it is impossible to form any triangle of non-zero area, return 0.

Example 1:

Input: [2,1,2]
Output: 5

Example 2:

Input: [1,2,1]
Output: 0

Example 3:

Input: [3,2,3,4]
Output: 10

Example 4:

Input: [3,6,2,3]
Output: 8

Note:

3 <= A.length <= 10000
1 <= A[i] <= 10^6

class Solution {
public:
    int largestPerimeter(vector<int>& A) {
        // 3 <= A.length <= 10000
        int res;
        if(A.size()==3) {
            sort(A.begin(),A.end(),greater<int>());
            if(A.at(1)+A.at(2)>A.at(0)) { 
                // the sum of any two sides is greater than the third side
                return A.at(0)+A.at(1)+A.at(2);
            }
        }
        else { // the number of sides is greater than 3
            sort(A.begin(),A.end(),greater<int>());
            for(int i=0;(i+2)<A.size();i++) {
                if (A.at(i+1)+A.at(i+2)>A.at(i)) {
                    return A.at(i)+A.at(i+1)+A.at(i+2);
                }
            }
        }
        return 0; // just judge the situation that matches the problem, and the rest will return 0
    }
};


/**
 * Submission Detail:
 * Runtime: 56 ms, faster than 71.90% of C++ online submissions for Largest Perimeter Triangle.
 * Memory Usage: 10.4 MB, less than 100.00% of C++ online submissions for Largest Perimeter Triangle.
 */

标签：Perimeter,976,Triangle,return,Largest,Input,than
来源： https://blog.csdn.net/ceezyyy11/article/details/89241451

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。