Simple solution in Java. Beats 100 %
Complexity

Time complexity:
O(1)


Space complexity:
O(1)

Code
# Complexity
- Time complexity:
O(1)

- Space complexity:
O(1)

# Code
```java []
class Solution {
    public String triangleType(int[] nums) {
        int a = nums[0];
        int b = nums[1];
        int c = nums[2];

        if (a + b <= c || a + c <= b || c + b <= a) {
            return "none";
        } else {
            if (a == b && a == c) {
                return "equilateral";
            } else if (a == b || a == c || b == c) {
                return "isosceles";
            } else {
                return "scalene";
            }
        }
    }
}
```
['Array', 'Java']