LeetCode Biweekly Contest 15
問題文
省略
省略
C++に変換後のコードはこちら
#define main dummy_main
{}
#undef main
int N, A[1000], B[1000];
class Solution {
public:
int removeCoveredIntervals(vector<vector<int>>& intervals) {
dummy_main();
int res = 0, mx = -int_inf;
N = intervals.size();
rep(i,N) A[i] = intervals[i][0], B[i] = intervals[i][1];
rep(i,N) B[i] = -B[i];
sortA(N,A,B);
rep(i,N) B[i] = -B[i];
rep(i,N){
if(mx < B[i]) res++;
mx >?= B[i];
}
return res;
}
};
Current time: 2024年04月30日00時13分49秒
Last modified: 2019年12月22日19時43分39秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る
Logged in as: unknown user (not login)