leetcode刷题之Largest Perimeter Triangle

最新推荐文章于 2021-12-15 21:00:00 发布

weixin_42522635

最新推荐文章于 2021-12-15 21:00:00 发布

阅读量101

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/weixin_42522635/article/details/95171241

博客围绕给定正长度数组，求解能构成非零面积三角形的最大周长。若无法构成非零面积三角形则返回0，并给出多个输入输出示例，如输入[2,1,2]输出5，输入[1,2,1]输出0等。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

class Solution:
    def largestPerimeter(self, A: List[int]) -> int:
        A.sort()
        for i in range(len(A)-3,-1,-1):
            if A[i]+A[i+1]>A[i+2]:
                return A[i] +A[i+1]+A[i+2]
            return 0