Valid Triangle Number(511)

最新推荐文章于 2023-05-16 19:19:39 发布

Kelly Fu

最新推荐文章于 2023-05-16 19:19:39 发布

阅读量127

点赞数

分类专栏： Leetcode Alorithm C

本文链接：https://blog.csdn.net/kelly_fumiao/article/details/84937859

版权

Leetcode Alorithm 同时被 2 个专栏收录

24 篇文章 0 订阅

订阅专栏

14 篇文章 0 订阅

订阅专栏

511—Valid Triangle Number

Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.

Example 1:

Input: [2,2,3,4]
Output: 3
Explanation:
Valid combinations are:
2,3,4 (using the first 2)
2,3,4 (using the second 2)
2,2,3

Note:
The length of the given array won’t exceed 1000.
The integers in the given array are in the range of [0, 1000].

C代码:

#include <stdlib.h>

int comp(const void*a, const void*b){
  return *(int*)a - *(int *)b;
}

int triangleNumber(int* nums, int numsSize) {
  int ans = 0;
  qsort(nums,numsSize, sizeof(int), comp);
  for(int a = 0; a < numsSize - 2; a++) {
    for (int b = a+1 ; b< numsSize - 1; b++){
      for (int c = b+1; c < numsSize; c++){
        if (nums[a] + nums[b] > nums[c]) {
          ans++;
        }else{
          break;
        }
      }
    }
  }
  return ans;
}

Complexity Analysis:

Time complexity : O(n^2)
Space complexity : O(logn). 排序的空间

思路:

知道如何构成三角形的的规则, 即两边之和大于第三边.
如何取出三边问题, 最简单的思路暴力枚举, 即三个边a,b,c分别都遍历一次数组.

Complexity Analysis:

Time complexity : O(n^3)
Space complexity : O(1)

这种情况下会出现超时的情况
解决方法: 把数组排序, 即只用判断a+b>c的条件即可, 这种情况下, c 边可能不用全部遍历数组, 出现不满足a+b>c 的情况即可进入下一轮循环(改变b).