text: Medium
  
  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:
  
  2. 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. `1 <= tree.length <= 40000`
  
  2. `0 <= tree[i] < tree.length`
  
  ## Analysis
  
  The question is actually:
  
  What is the length of longest subarray that contains up to two distinct integers?
  
  ## Solution
  
  Sliding Window - Two Pointers Fast-Slow - O(n) time, O(n) space - (66 ms, faster than 44.17%)
  
  ``````class Solution {
  public int totalFruit(int[] tree) {
  HashMap<Integer, Integer> count = new HashMap<Integer, Integer>();
  int firstIdx = 0;
  int totalMax = 0;
  
  for (int i = 0; i < tree.length; i++) {
  count.put(tree[i], count.getOrDefault(tree[i], 0) + 1);
  while (count.size() > 2) {
  count.put(tree[firstIdx], count.get(tree[firstIdx]) - 1);
  if (count.get(tree[firstIdx]) == 0) {
  count.remove(tree[firstIdx]);
  }
  firstIdx++;
  }
  totalMax = Math.max(totalMax, i - firstIdx + 1);
  }
metadata: {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}