虚拟参赛一波
q1 判断奇偶
class Solution {
public:
bool checkTwoChessboards(string coordinate1, string coordinate2) {
int c1 = coordinate1[0]-'a' + coordinate1[1] - '1';
int c2 = coordinate2[0]-'a' + coordinate2[1] - '1';
return c1 % 2 == c2 % 2;
}
};
q2 size k的heap
class Solution {
public:
vector<int> resultsArray(vector<vector<int>>& queries, int k) {
priority_queue<int> pq;
vector<int> ans;
for(auto& q : queries){
int dist = abs(q[0])+abs(q[1]);
pq.push(dist);
if(pq.size() > k){
pq.pop();
}
if(pq.size() < k){
ans.push_back(-1);
} else {
ans.push_back(pq.top());
}
}
return ans;
}
};
q3不会
q4不会
我好烂