Skip to content

Commit 1b779e3

Browse files
committed
pass problem 1004 - max consecutive ones iii
1 parent b3b67ce commit 1b779e3

File tree

3 files changed

+34
-7
lines changed

3 files changed

+34
-7
lines changed
Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
package double_pointers.max_consecutive_ones_iii;
2+
3+
/**
4+
* @author Bota5ky
5+
* @link <a href="https://leetcode.cn/problems/max-consecutive-ones-iii/">1004. 最大连续1的个数 III</a>
6+
* @since 2023-11-03 21:49
7+
*/
8+
class Solution {
9+
public int longestOnes(int[] nums, int k) {
10+
int maxOnes = 0;
11+
int zeros = 0;
12+
for (int i = 0, j = 0; j < nums.length; j++) {
13+
if (nums[j] == 0) {
14+
zeros++;
15+
}
16+
if (zeros > k) {
17+
while (nums[i] != 0) {
18+
i++;
19+
}
20+
zeros--;
21+
i++;
22+
}
23+
maxOnes = Math.max(maxOnes, j - i + 1);
24+
}
25+
return maxOnes;
26+
}
27+
}

double_pointers/maximum_points_you_can_obtain_from_cards/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ public int maxScore(int[] cardPoints, int k) {
1111
for (int i = 0; i < k; i++) {
1212
max += cardPoints[i];
1313
}
14-
var sum = max;
14+
int sum = max;
1515
for (int i = k - 1, j = cardPoints.length - 1; i >= 0; i--) {
1616
sum = sum - cardPoints[i] + cardPoints[j--];
1717
max = Math.max(max, sum);

hash_table/group_anagrams/Solution.java

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -11,24 +11,24 @@
1111
*/
1212
class Solution {
1313
public List<List<String>> groupAnagrams(String[] strs) {
14-
var map = new HashMap<String, ArrayList<String>>();
14+
HashMap<String, ArrayList<String>> map = new HashMap<>();
1515
for (String str : strs) {
16-
var key = generateKey(str);
17-
var list = map.getOrDefault(key, new ArrayList<>());
16+
String key = generateKey(str);
17+
ArrayList<String> list = map.getOrDefault(key, new ArrayList<>());
1818
list.add(str);
1919
map.put(key, list);
2020
}
21-
var res = new ArrayList<List<String>>();
21+
ArrayList<List<String>> res = new ArrayList<List<String>>();
2222
map.forEach((k,v) -> res.add(v));
2323
return res;
2424
}
2525

2626
private String generateKey(String str) {
27-
var chars = new int[26];
27+
int[] chars = new int[26];
2828
for (int i = 0; i < str.length(); i++) {
2929
chars[str.charAt(i) - 'a']++;
3030
}
31-
var sb = new StringBuilder();
31+
StringBuilder sb = new StringBuilder();
3232
for (int i = 0; i < chars.length; i++) {
3333
int count = chars[i];
3434
if (count > 0) {

0 commit comments

Comments
 (0)