611. Valid Triangle Number
来源:互联网 发布:索菲亚用什么软件 编辑:程序博客网 时间:2024/06/05 16:07
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: 3Explanation:Valid combinations are: 2,3,4 (using the first 2)2,3,4 (using the second 2)2,2,3
Note:
1. The length of the given array won't exceed 1000. 2. The integers in the given array are in the range of [0, 1000].
先给出自己的未能AC的代码,一般思路,回溯法,超时,意料之内,但还是写了出来。
bool isTriangle(vector<int>& path){ int a = path[0], b = path[1], c = path[2]; if (a + b > c && a + c > b && b + c > a)return true; else return false;}void dfs_Tri(vector<int>& nums, int pos, vector<int>& path, int &cnt){ if (path.size() == 3){ if (isTriangle(path)){ cnt++; } return; } for (int i = pos; i < nums.size(); i++){ path.push_back(nums[i]); dfs_Tri(nums, i + 1, path, cnt); path.pop_back(); }}int triangleNumber(vector<int>& nums) { if (nums.size() < 3)return 0; vector<int> path; int cnt = 0; dfs_Tri(nums, 0, path, cnt); return cnt;}
其实此题要用一个O(N^2 * log N)去解决,先对内部的元素排序,然后找出对小于两个元素的起始的内部元素的坐标,然后每次循环相加,找出小于两边之和的方法用二分查找法;
int triangleNumber(vector<int>& nums) { if (nums.size() < 3)return 0; sort(nums.begin(), nums.end()); int low, mid, high; int cnt = 0; for (int i = 0; i < nums.size() - 2; i++){ for (int j = i + 1; j < nums.size() - 1; j++){ int sum = nums[i] + nums[j]; low = j + 1, high = nums.size() - 1; while (low <= high){ mid = (low + high) / 2; if (nums[mid] >= sum)high = mid - 1; else low = mid + 1; } cnt += low - j - 1; } } return cnt;}
阅读全文
0 0
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- [LeetCode]611. Valid Triangle Number
- [LeetCode] 611. Valid Triangle Number
- [leetcode]611. Valid Triangle Number
- leetcode 611. Valid Triangle Number
- [leetcode] 611. Valid Triangle Number
- Leetcode:611. Valid Triangle Number
- leetcode 611. Valid Triangle Number
- 【LeetCode】611.Valid Triangle Number解题报告
- 575. Distribute Candies-分糖果问题
- vmware虚拟机复制导致网络不能上的解决方法
- 流畅的python--特殊方法
- php-10
- DPDK17.05 第一次试用心得与问题记录
- 611. Valid Triangle Number
- Spring定时任务的几种实现
- LINQ 查询简介 (C#)
- 【C/C++】计时函数比较
- 使用FEA Spk探索经典数据集MovieLens
- 基于蓝牙4.0(btle)的简单通讯流程
- matplotlib.pyplot画图 图片的二进制流的获取
- 动态网页开发基础
- 推荐系统评测指标