Skip to content

Commit 6f0f4c8

Browse files
add 4083
1 parent 870585e commit 6f0f4c8

2 files changed

Lines changed: 17 additions & 0 deletions

File tree

  • paginated_contents/algorithms/5th_thousand
  • src/main/java/com/fishercoder/solutions/fifththousand

‎paginated_contents/algorithms/5th_thousand/README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
| # | Title | Solutions | Video | Difficulty | Tag
22
|------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------|--------------------------------------|------------|----------------------------------------------------------------------
3+
| 4083 | [Minimum Deletions to Make Array Sharp](https://leetcode.com/problems/minimum-deletions-to-make-array-sharp/) | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4083.java) | | Easy |
34
| 4080 | [Design Bus Seat Booking System](https://leetcode.com/problems/design-bus-seat-booking-system/) | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4080.java) | | Medium |
45
| 4079 | [Prime Subset Selection I](https://leetcode.com/problems/prime-subset-selection-i/) | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4079.java) | | Medium |
56
| 4078 | [Three Fibonacci Sum](https://leetcode.com/problems/three-fibonacci-sum/) | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4078.java) | | Easy |
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
package com.fishercoder.solutions.fifththousand;
2+
3+
public class _4083 {
4+
public static class Solution1 {
5+
public int minDeletions(int[] nums) {
6+
int d = 0;
7+
for (int i = 0; i < nums.length - 1; i++) {
8+
while (i < nums.length - 1 && nums[i] == nums[i + 1]) {
9+
d++;
10+
i++;
11+
}
12+
}
13+
return d;
14+
}
15+
}
16+
}

0 commit comments

Comments
 (0)