题解 | #在二叉树中找到两个节点的最近公共祖先#

import java.util.; public class Solution{ public ArrayList<ArrayList> FindContinuousSequence(int sum){ ArrayList<ArrayList> result = new ArrayList<>(); if(sum < 3) return result; int low = 1,high = 2; while(high > low){ int cur = (high + low)(high - low +1) / 2; if(cur == sum){ ArrayList list = new ArrayList<>(); for(int i = low;i <= high;i++){ list.add(i); } result.add(list); low ++; }else if(cur < sum){ high ++; }else{ low ++; } } return result;

}

}