252. Meeting Rooms

来源：互联网发布：mysql if exists用法编辑：程序博客网时间：2024/05/19 04:05

Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend all meetings.

For example,
Given [[0, 30],[5, 10],[15, 20]],

return false.

/** * 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 boolean canAttendMeetings(Interval[] intervals) {        Arrays.sort(intervals, new Comparator<Interval>(){            public int compare(Interval i1, Interval i2){                return i1.start - i2.start;            }        });                for(int i=1; i<intervals.length; i++){            if(intervals[i].start < intervals[i-1].end){                return false;            }        }        return true;    }}

0 0

Leetcode-252.Meeting Rooms
LeetCode 252. Meeting Rooms
252. Meeting Rooms
252. Meeting Rooms
Leetcode 252. Meeting Rooms & 253. Meeting Rooms II
Leetcode Everyday: 252. Meeting Rooms
LeetCode 252. Meeting Rooms 会议室
Meeting Rooms
Meeting Rooms
Meeting Rooms
Meeting Rooms
[leetcode] 252. Meeting Rooms 解题报告
LeetCode 252. Meeting Rooms（会议室）
Leetcode 252. Meeting Rooms (Easy) (cpp)
[Leetcode] 252. Meeting Rooms 解题报告
Leetcode: Meeting Rooms
[LeetCode 252] Meeting Rooms
[leetcode 252] Meeting Rooms
Android一点打造全功能适配AutoView
安卓配置问题
学习Json小体会
SELinux&SEAndroid简介
docker命令自动补全
252. Meeting Rooms
Mybatis的注解应用之关系映射
JAVA使用http发送post或get请求实例
Swift 3.0 学习笔记-5-函数
linux初学 unit2 练习
树莓派上安装turtlebot
nginx源码分析—处理继承的sockets
ASP.Net学习笔记008--ASP.Net揭秘之Input版自增补充说明
蓝桥杯2013年第四届决赛C_C++程序设计本科B组