You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array fruits where fruits[i] is the type of fruit the ith tree produces.
You want to collect as much fruit as possible. However, the owner has some strict rules that you must follow:
- You only have two baskets, and each basket can only hold a single type of fruit. There is no limit on the amount of fruit each basket can hold.
- Starting from any tree of your choice, you must pick exactly one fruit from every tree (including the start tree) while moving to the right. The picked fruits must fit in one of your baskets.
- Once you reach a tree with fruit that cannot fit in your baskets, you must stop.
Given the integer array fruits, return the maximum number of fruits you can pick.
Example 1:
Input: fruits = [1,2,1] Output: 3 Explanation: We can pick from all 3 trees.
Example 2:
Input: fruits = [0,1,2,2] Output: 3 Explanation: We can pick from trees [1,2,2]. If we had started at the first tree, we would only pick from trees [0,1].
Example 3:
Input: fruits = [1,2,3,2,2] Output: 4 Explanation: We can pick from trees [2,3,2,2]. If we had started at the first tree, we would only pick from trees [1,2].
Constraints:
1 <= fruits.length <= 1050 <= fruits[i] < fruits.length
class Solution:
def totalFruit(self, fruits: List[int]) -> int:
cnt = Counter()
ans = j = 0
for i, x in enumerate(fruits):
cnt[x] += 1
while len(cnt) > 2:
y = fruits[j]
cnt[y] -= 1
if cnt[y] == 0:
cnt.pop(y)
j += 1
ans = max(ans, i - j + 1)
return ansclass Solution:
def totalFruit(self, fruits: List[int]) -> int:
cnt = Counter()
j = 0
for x in fruits:
cnt[x] += 1
if len(cnt) > 2:
y = fruits[j]
cnt[y] -= 1
if cnt[y] == 0:
cnt.pop(y)
j += 1
return len(fruits) - jclass Solution {
public int totalFruit(int[] fruits) {
Map<Integer, Integer> cnt = new HashMap<>();
int ans = 0;
for (int i = 0, j = 0; i < fruits.length; ++i) {
int x = fruits[i];
cnt.put(x, cnt.getOrDefault(x, 0) + 1);
while (cnt.size() > 2) {
int y = fruits[j++];
cnt.put(y, cnt.get(y) - 1);
if (cnt.get(y) == 0) {
cnt.remove(y);
}
}
ans = Math.max(ans, i - j + 1);
}
return ans;
}
}class Solution {
public int totalFruit(int[] fruits) {
Map<Integer, Integer> cnt = new HashMap<>();
int j = 0, n = fruits.length;
for (int x : fruits) {
cnt.put(x, cnt.getOrDefault(x, 0) + 1);
if (cnt.size() > 2) {
int y = fruits[j++];
cnt.put(y, cnt.get(y) - 1);
if (cnt.get(y) == 0) {
cnt.remove(y);
}
}
}
return n - j;
}
}class Solution {
public:
int totalFruit(vector<int>& fruits) {
unordered_map<int, int> cnt;
int ans = 0;
for (int i = 0, j = 0; i < fruits.size(); ++i) {
int x = fruits[i];
++cnt[x];
while (cnt.size() > 2) {
int y = fruits[j++];
if (--cnt[y] == 0) cnt.erase(y);
}
ans = max(ans, i - j + 1);
}
return ans;
}
};class Solution {
public:
int totalFruit(vector<int>& fruits) {
unordered_map<int, int> cnt;
int j = 0, n = fruits.size();
for (int& x : fruits) {
++cnt[x];
if (cnt.size() > 2) {
int y = fruits[j++];
if (--cnt[y] == 0) cnt.erase(y);
}
}
return n - j;
}
};func totalFruit(fruits []int) int {
cnt := map[int]int{}
ans, j := 0, 0
for i, x := range fruits {
cnt[x]++
for ; len(cnt) > 2; j++ {
y := fruits[j]
cnt[y]--
if cnt[y] == 0 {
delete(cnt, y)
}
}
ans = max(ans, i-j+1)
}
return ans
}
func max(a, b int) int {
if a > b {
return a
}
return b
}func totalFruit(fruits []int) int {
cnt := map[int]int{}
j := 0
for _, x := range fruits {
cnt[x]++
if len(cnt) > 2 {
y := fruits[j]
cnt[y]--
if cnt[y] == 0 {
delete(cnt, y)
}
j++
}
}
return len(fruits) - j
}function totalFruit(fruits: number[]): number {
const n = fruits.length;
const map = new Map<number, number>();
let res = 0;
let left = 0;
let right = 0;
while (right < n) {
map.set(fruits[right], (map.get(fruits[right]) ?? 0) + 1);
right++;
while (map.size > 2) {
const k = fruits[left++];
map.set(k, map.get(k) - 1);
if (map.get(k) === 0) {
map.delete(k);
}
}
res = Math.max(res, right - left);
}
return res;
}function totalFruit(fruits: number[]): number {
const n = fruits.length;
const map = new Map<number, number>();
let i = 0;
for (const fruit of fruits) {
map.set(fruit, (map.get(fruit) ?? 0) + 1);
if (map.size > 2) {
const k = fruits[i++];
map.set(k, map.get(k) - 1);
if (map.get(k) == 0) {
map.delete(k);
}
}
}
return n - i;
}use std::collections::HashMap;
impl Solution {
pub fn total_fruit(fruits: Vec<i32>) -> i32 {
let n = fruits.len();
let mut map = HashMap::new();
let mut res = 0;
let mut left = 0;
let mut right = 0;
while right < n {
*map.entry(fruits[right]).or_insert(0) += 1;
right += 1;
while map.len() > 2 {
let k = fruits[left];
map.insert(k, map[&k] - 1);
if map[&k] == 0 {
map.remove(&k);
}
left += 1;
}
res = res.max(right - left);
}
res as i32
}
}use std::collections::HashMap;
impl Solution {
pub fn total_fruit(fruits: Vec<i32>) -> i32 {
let n = fruits.len();
let mut map = HashMap::new();
let mut i = 0;
for &fruit in fruits.iter() {
*map.entry(fruit).or_insert(0) += 1;
if map.len() > 2 {
let k = fruits[i];
map.insert(k, map[&k] - 1);
if map[&k] == 0 {
map.remove(&k);
}
i += 1;
}
}
(n - i) as i32
}
}