資訊專欄INFORMATION COLUMN
Problem
In a row of trees, the i-th tree produces fruit with type tree[i].
You start at any tree of your choice, then repeatedly perform the following steps:
Add one piece of fruit from this tree to your baskets. If you cannot, stop.
Move to the next tree to the right of the current tree. If there is no tree to the right, stop.
Note that you do not have any choice after the initial choice of starting tree: you must perform step 1, then step 2, then back to step 1, then step 2, and so on until you stop.
You have two baskets, and each basket can carry any quantity of fruit, but you want each basket to only carry one type of fruit each.
What is the total amount of fruit you can collect with this procedure?
Example 1:
Input: [1,2,1] Output: 3 Explanation: We can collect [1,2,1].
Example 2:
Input: [0,1,2,2] Output: 3 Explanation: We can collect [1,2,2]. If we started at the first tree, we would only collect [0, 1].
Example 3:
Input: [1,2,3,2,2] Output: 4 Explanation: We can collect [2,3,2,2]. If we started at the first tree, we would only collect [1, 2].
Example 4:
Input: [3,3,3,1,2,1,1,2,3,3,4] Output: 5 Explanation: We can collect [1,2,1,1,2]. If we started at the first tree or the eighth tree, we would only collect 4 fruits.
Note:
1 <= tree.length <= 40000 0 <= tree[i] < tree.lengthSolution
class Solution {
public int totalFruit(int[] tree) {
if (tree.length <= 2) return tree.length;
Map map = new HashMap<>();
int start = 0, max = 0;
for (int i = 0; i < tree.length; i++) {
map.put(tree[i], map.getOrDefault(tree[i], 0)+1);
while (map.size() > 2) {
map.put(tree[start], map.get(tree[start])-1);
if (map.get(tree[start]) == 0) map.remove(tree[start]);
start++;
}
max = Math.max(max, i-start+1);
}
return max;
}
}
文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。
轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/71941.html
Problem Given a node from a cyclic linked list which is sorted in ascending order, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be a r...
閱讀 1238·2021-11-24 09:39
閱讀 385·2019-08-30 14:12
閱讀 2596·2019-08-30 13:10
閱讀 2441·2019-08-30 12:44
閱讀 966·2019-08-29 16:31
閱讀 851·2019-08-29 13:10
閱讀 2442·2019-08-27 10:57
閱讀 3158·2019-08-26 13:57
