递归解决卖桃子问题java

package Class.recursion;

public class SellPeach {
    /*
        1. 每次卖桃子，桃子数量 = (原有数量-1)/2
        2. 判断初始桃子数量需要的条件
             (1) 卖桃子的次数n  (2) 剩余桃子的数量peach
     */
    private int n;    // n = 5, 卖桃子的次数
    private int leftPeaches;   // leftPeaches = 8, 最后剩余的桃子数
    private int trades = 0;   // 交易次数

    public SellPeach(int n, int leftPeaches) {
        this.n = n;
        this.leftPeaches = leftPeaches;
    }

    // 用for循环也可以解决问题
    public int BackPeach() {
        leftPeaches = leftPeaches * 2 + 1;
        trades++;
        if(trades < n) {
            BackPeach();
        }
        return leftPeaches;
    }

}

class mainn {
    public static void main(String[] args) {
        SellPeach cal = new SellPeach(5, 8);
        int peaches = cal.BackPeach();
        System.out.println(peaches);
    }
}