7-4日刷题

    public ArrayList<Integer> subarraySumClosest(int[] nums) {
        // write your code here
        ArrayList<Integer> res = new ArrayList<Integer>();
        if (nums == null || nums.length == 0) {
            return res;
        }
        TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
        int sum = 0;
        int minDif = Integer.MAX_VALUE;
        res.add(0);
        res.add(0);
        for (int i = 0; i < nums.length; ++i) {
            sum += nums[i];
            Map.Entry floor = map.floorEntry(sum);
            Map.Entry ceiling = map.ceilingEntry(sum);
            if (floor != null || ceiling != null) {
                if (floor == null || (ceiling != null && Math.abs((int) floor.getKey() - sum) > Math.abs((int) ceiling.getKey() - sum))) {
                    if (Math.abs((int) ceiling.getKey() - sum) < minDif) {
                        res.set(0, (int) ceiling.getValue() + 1);
                        res.set(1, i);
                        minDif = Math.abs((int) ceiling.getKey() - sum);
                    }
                } else {
                    if (Math.abs((int) floor.getKey() - sum) < minDif) {
                        res.set(0, (int) floor.getValue() + 1);
                        res.set(1, i);
                        minDif = Math.abs((int) floor.getKey() - sum);
                    }
                }
            }
            map.put(sum, i);
        }
        return res;
    }