Skip to content

Commit 46398d2

Browse files
solve #3024: Type of Triangle in java
1 parent f22a25b commit 46398d2

File tree

2 files changed

+23
-1
lines changed

2 files changed

+23
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -885,7 +885,7 @@
885885
| 3010 | [Divide an Array Into Subarrays With Minimum Cost I](https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i) | [![Java](assets/java.png)](src/DivideAnArrayIntoSubarraysWithMinimumCostI.java) | |
886886
| 3014 | [Minimum Number of Pushes to Type Word I](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i) | [![Java](assets/java.png)](src/MinimumNumberOfPushesToTypeWordI.java) | |
887887
| 3019 | [Number of Changing Keys](https://leetcode.com/problems/number-of-changing-keys) | [![Java](assets/java.png)](src/NumberOfChangingKeys.java) | |
888-
| 3024 | [Type of Triangle](https://leetcode.com/problems/type-of-triangle) | | |
888+
| 3024 | [Type of Triangle](https://leetcode.com/problems/type-of-triangle) | [![Java](assets/java.png)](src/TypeOfTriangle.java) | |
889889
| 3028 | [Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary) | | |
890890
| 3032 | 🔒 [Count Numbers With Unique Digits II](https://leetcode.com/problems/count-numbers-with-unique-digits-ii) | | |
891891
| 3038 | [Maximum Number of Operations With the Same Score I](https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i) | | |

src/TypeOfTriangle.java

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
// https://leetcode.com/problems/type-of-triangle
2+
// T: O(1)
3+
// S: O(1)
4+
5+
public class TypeOfTriangle {
6+
public String triangleType(int[] sides) {
7+
if (!isValidTriangle(sides)) {
8+
return "none";
9+
}
10+
if (sides[0] == sides[1] && sides[1] == sides[2]) {
11+
return "equilateral";
12+
}
13+
if (sides[0] == sides[1] || sides[0] == sides[2] || sides[1] == sides[2]) {
14+
return "isosceles";
15+
}
16+
return "scalene";
17+
}
18+
19+
private static boolean isValidTriangle(int[] sides) {
20+
return sides[0] + sides[1] > sides[2] && sides[0] + sides[2] > sides[1] && sides[1] + sides[2] > sides[0];
21+
}
22+
}

0 commit comments

Comments
 (0)