package com.hp.algorithm.mostpeach;

import java.util.ArrayList;
import java.util.List;
public class MostPeach
{

public static int currMaxPeachNum = 0;//当前摘的最大一颗树
public static int mostPeach(List<Integer> treeWithPeach){
    if(null == treeWithPeach){
        return 0;
    }
    if(1 == treeWithPeach.size()){
        if(currMaxPeachNum > treeWithPeach.get(0)){
            return 0;
        }
        return 1;
    }

    int pick = 0;
    int notPick = 0;
    if(currMaxPeachNum <= treeWithPeach.get(0)){
        //情况1：当前桃子树大于currMaxPeachNum，摘。摘了之后还要摘后面的树
        currMaxPeachNum = treeWithPeach.get(0);
        pick = 1 + mostPeach(treeWithPeach.subList(1, treeWithPeach.size()));
    }

    //情况2：当前桃子树大于currMaxPeachNum，不摘
    //情况3：当前桃子树小于currMaxPeachNum，不摘
    notPick = mostPeach(treeWithPeach.subList(1, treeWithPeach.size()));

    if(pick > notPick){
        return pick;
    }
    return notPick;
}
/**
 * @param args
 */
public static void main(String[] args)
{
    List<Integer> case1 = new ArrayList<Integer>();
    case1.add(5);case1.add(10);case1.add(4);case1.add(5);case1.add(12);case1.add(8);
    List<Integer> case2 = new ArrayList<Integer>();
    case2.add(5);case2.add(3);case2.add(5);case2.add(4);
    List<Integer> case3 = new ArrayList<Integer>();
    case3.add(1);
    System.out.println(mostPeach(case3));
}

}