57. Insert Interval
来源:互联网 发布:淘宝耐克篮球鞋正品店 编辑:程序博客网 时间:2024/05/17 00:06
题目:
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].
思路:这题还是很简单的,根据例子就应该想到一种解决方案。
关键是找到newStart和newEnd。代码写的很烂
/** * 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> result = new ArrayList<>(); if(intervals.size() == 0) { result.add(newInterval); return result; } int newStart = -1,newEnd = -1; int flag = 0; for(Interval interval : intervals) { int start = interval.start; int end = interval.end; if(newInterval.start>=start && newInterval.start<=end) { newStart = start; } if(newInterval.end>=start && newInterval.end<=end) { newEnd = end; } } if(newStart == -1){newStart = newInterval.start;} if(newEnd == -1){newEnd = newInterval.end;} for(Interval interval : intervals) { if(interval.end<newStart) { result.add(interval); }else if(flag == 0) { result.add(new Interval(newStart, newEnd)); flag = 1; } if(interval.start>newEnd) { result.add(interval); } } if(flag == 0) result.add(newInterval); return result; }}
0 0
- LeetCode --- 57. Insert Interval
- [Leetcode] 57. Insert Interval
- [LeetCode]57.Insert Interval
- [leetcode] 57.Insert Interval
- 57. Insert Interval
- [leetcode] 57.Insert Interval
- 57. Insert Interval
- 57. Insert Interval
- lkeetcode 57. Insert Interval
- 57. Insert Interval
- Leetcode 57. Insert Interval
- LeetCode 57. Insert Interval
- 57. Insert Interval
- 57. Insert Interval
- 57. Insert Interval
- 57. Insert Interval
- LeetCode 57. Insert Interval
- [LeetCode] 57. Insert Interval
- vim编辑器的使用
- linux下创建多线程执行
- iphone——日期处理
- C# Console类
- 关于img ,你必须注意的
- 57. Insert Interval
- Shell数组:shell数组的定义、数组长度
- linux网络编程常用头文件
- 為什麼比 GIT 更好--理解 Mercurial 版本管理系統
- 安装busybox提示Invalid cross-device link错误
- QQ登录
- Java实现快速排序
- TCP/Protobuf之基础知识准备
- IOS模仿微信小视频开发心得