剑指offer四十一之和为S的连续正数序列

import java.util.ArrayList;


public class Solution {
    public ArrayList<ArrayList<Integer>> FindContinuousSequence(int sum) {

        ArrayList<ArrayList<Integer>> arrayList = new ArrayList<ArrayList<Integer>>();

        int phigh = 2, plow = 1;

        while (phigh > plow) {
            int curSum = (phigh + plow) * (phigh - plow + 1) / 2; //求序列的和
            if (curSum < sum)
                phigh++;
            if (curSum == sum) {
                ArrayList<Integer> arrayListTemp=new ArrayList<Integer>();
                for (int i = plow; i <= phigh; i++){
                    arrayListTemp.add(i);
                }
                arrayList.add(arrayListTemp);
                plow++;
            }

            if (curSum > sum)
                plow++;
        }

        return arrayList;
    }
}