#P1318. 2023.6.2-TikTok春招(澳大利亚区域)-第四题
2023.6.2-TikTok春招(澳大利亚区域)-第四题
![](https://s3.bmp.ovh/imgs/2024/09/03/9ec1757951030a02.jpg)
You have received several meeting invitations in your calendar represented by an array meetings.The start and end time of each meeting invitation is indicated as meetings[i] =[starti,endi]. Find out the fewest number of meeting invitations to be rejected so that there is no conflicts of meetings in your calendar.
∣meetings∣≤105
Example 1:
Input
4
1 2
2 3
3 4
1 3
Output:
1
**Explanation: **
Reject [1,3] to avoid the conflicts
Example 2:
Input
2
1 2
2 3
Output:
0
Explanation: You don't need to reject any meeting invitations
扫码备注加群即可,期待您的到来~
By signing up a CodeFun2000 universal account, you can submit code and join discussions in all online judging services provided by us.