# 0252. Meeting Rooms
###### tags: `Leetcode` `Easy` `Line Sweep`
Link: https://leetcode.com/problems/meeting-rooms/
## 思路 $O(NlogN)$ $O(1)$
不需要差分法也可以做
差分法相当于用空间换时间复杂度
## Code

class Solution {
    public boolean canAttendMeetings(int[][] intervals) {
        Arrays.sort(intervals, (a,b)->(a[0]-b[0]));
        for(int i=0; i<intervals.length-1; i++){
            if(intervals[i][1]>intervals[i+1][0]) return false;
        }
        return true;
    }
}