Commit 383b564

committed

revise

1 parent dfa8680 commit 383b564Copy full SHA for 383b564

File tree

-2

lines changed

-2

lines changed

Lines changed: 3 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -57,7 +57,7 @@`
`57`	`57`	`- 解题思路:在这个题目里,如果一个人要参加所有会议,那么所有会议的时间应该不能重合,所以只需要判断后一个会议开始的start > 前一个会议结束的end就就可以,如果end>start,就返回false。首先得先对所有子数组的start进行排序,然后再进行判断start和end`
`58`	`58`
`59`	`59`	`Java解法`
`60`		-```
	`60`	+```java
`61`	`61`	`class Solution{`
`62`	`62`	`public boolean canAttendMeetings(Interval[] intervals){`
`63`	`63`	`Arrays.sort(intervals,(x,y)->(x.start-y.start);`
`@@ -69,8 +69,9 @@ class Solution{`
`69`	`69`	`}`
`70`	`70`	`return true;`
`71`	`71`	```
	`72`	`+`
`72`	`73`	`Python解法`
`73`		-```
	`74`	+```python
`74`	`75`	`class Solution(object):`
`75`	`76`	`def canAttendMeetings(self, intervals):`
`76`	`77`	`"""`

Comments

(0)