LeetCode - Insert Interval

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).
You may assume that the intervals were initially sorted according to their start times.
Example 1:
Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].
Example 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].

This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {
    public ArrayList<Interval> insert(ArrayList<Interval> intervals, Interval newInterval) {
        ArrayList<Interval> lst = new ArrayList<Interval>();
        Interval tmp = newInterval;
        for(Interval i : intervals){
            if(i.end<tmp.start) {
                lst.add(i);
            } else if(i.start>tmp.end) {
                lst.add(tmp);
                tmp = i;
            } else {
                tmp = new Interval(Math.min(i.start, tmp.start), Math.max(i.end, tmp.end));
            }
        }
        lst.add(tmp);
        return lst;
    }
}

==========

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {
    public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
        List<Interval> res = new ArrayList<>();
        for (int i = 0; i < intervals.size(); i++) {
            Interval tmp = intervals.get(i);
            if (tmp.end < newInterval.start) {
                res.add(tmp);
            } else if (tmp.start > newInterval.end) {
                res.add(newInterval);
                newInterval = tmp;
            } else {
                newInterval.start = Math.min(tmp.start, newInterval.start);
                newInterval.end = Math.max(tmp.end, newInterval.end);
            }
        }
        res.add(newInterval);
        return res;
    }
}