-
環(huán)和桿： https://leetcode.cn/problems/rings-and-rods/
-
統(tǒng)計(jì)范圍內(nèi)的元音字符串?dāng)?shù)： https://leetcode.cn/problems/count-the-number-of-vowel-strings-in-range/
-
最長(zhǎng)平衡子字符串： https://leetcode.cn/problems/find-the-longest-balanced-substring-of-a-binary-string/
-
K 個(gè)元素的最大和： https://leetcode.cn/problems/maximum-sum-with-exactly-k-elements/
PriorityQueue優(yōu)先取出最大值；文章來源：http://www.zghlxwxcb.cn/news/detail-821865.html -
最長(zhǎng)奇偶子數(shù)組： https://leetcode.cn/problems/longest-even-odd-subarray-with-threshold/
根據(jù)題意寫代碼，所有條件true不好判斷，可以先把false的返回；文章來源地址http://www.zghlxwxcb.cn/news/detail-821865.html
class Solution {
public int longestAlternatingSubarray(int[] nums, int threshold) {
int max = 0;
for (int i = 0; i < nums.length; i++) {
for (int r = i; r < nums.length; r++) {
if (isSatisfied(nums, threshold, i, r)) {
max = Math.max(r - i+1, max);
}
}
}
return max;
}
private static boolean isSatisfied(int[] nums, int threshold, int l, int r) {
if (nums[l] % 2 != 0) {
return false;
}
for (int i = l; i <= r; i++) {
if (nums[i] > threshold || (i < r && nums[i] % 2 == nums[i + 1])) {
return false;
}
}
return true;
}
}
到了這里，關(guān)于Java算法 leetcode簡(jiǎn)單刷題記錄6的文章就介紹完了。如果您還想了解更多內(nèi)容，請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！
