Given a vector of lengths [a b c], determines whether a triangle with non-zero area (in two-dimensional Euclidean space, smarty!) could have sides of those lengths.
[1 2 1000] ---> false
[3 4 5] ---> true
[5 5 5] ---> true
Tests with sides that are not sorted should be added.
I wanted to try out the Hankel here. This is more than necessary. It checks to see that the sum of all pairs of sides are greater than the remaining side. You really only need to do this to compare against the maximum length side.
This is just bad, only gaming the test suit. There is nothing to be learned from this.
worst solution ,i have ever seen
Added to test suite to eliminate this "solution".
Distance walked 1D
2 b | ~ 2 b
Remove the two elements next to NaN value
Basics: 'Find the eigenvalues of given matrix
Rounding off numbers to n decimals
Figurate number triangle
So many choices
Right and wrong
Is my wife right? Now with even more wrong husband
Cull vector elements that contain a specified digit
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office