【剑指 Offer 57 - II. 和为s的连续正数序列】（list转int[]）

 【解题思路】

设置两个指针i,j < target，如果i,j之间的数字之和等于target则加入该数据。

class Solution {
    public int[][] findContinuousSequence(int target) {
        List<int[]> list = new ArrayList<>();

        for(int i = 1; i < target-2; i++)
        {
            for(int j = i+1; j < target-1; j++)
            {
                int cnt = j-i+1;
                double sum = ((double)(i+j)/2)*cnt;
                if(sum > target) break;
                if(sum == target)
                {
                    int[] ans = new int[cnt];
                    int k = 0;
                    while(k < cnt)
                    {
                        ans[k] = i+k;
                        k++;
                    }
                    list.add(ans);
                    break;
                }
            }
        }
        return list.toArray(new int[list.size()][]);
    }
}

list转为int[]:

List<int[]> list=new ArrayList<>();
return list.toArray(new int[list.size()][]);