Simple java code 0 ms beats 100 %
Complexity\n\n\n# Code\n\nclass Solution {\n    public String triangleType(int[] nums) {\n        if(nums[0]+nums[1]<=nums[2]||nums[0]+nums[2]<=nums[1]||nums[1]
# Complexity\n![image.png](https://assets.leetcode.com/users/images/5068125e-3a4b-4879-b177-9609e81aaaeb_1706976470.033528.png)\n\n# Code\n```\nclass Solution {\n    public String triangleType(int[] nums) {\n        if(nums[0]+nums[1]<=nums[2]||nums[0]+nums[2]<=nums[1]||nums[1]+nums[2]<=nums[0]){\n            return "none";\n        }\n        else if(nums[0]==nums[1]&&nums[1]==nums[2]){\n            return "equilateral";\n        }\n        else if(nums[0]==nums[1]||nums[0]==nums[2]||nums[1]==nums[2]){\n            return "isosceles";\n        }\n        else{\n            return "scalene";\n        }\n    }\n}\n```
['Java']