valid-triangle-number

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array <code>nums</code>, return the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.

&nbsp;
Example 1:

<pre>
Input: nums = [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
</pre>

Example 2:

<pre>
Input: nums = [4,2,3,4]
Output: 4
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 1000</code></li>
</ul>

triangleNumber

Principal

Valid Triangle Number

Array

Two Pointers

Binary Search

Greedy

Sorting

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs