Q1
看奇数偶数
Python Code:
class Solution:
def checkTwoChessboards(self, coordinate1: str, coordinate2: str) -> bool:
if ((ord(coordinate1[0]) - ord("a")) + int(coordinate1[1])) % 2 ==
((ord(coordinate2[0]) - ord("a")) + int(coordinate2[1])) % 2:
return True
else:
return False
Q2
维护一个max_heap
Python Code:
import heapq
class Solution:
def resultsArray(self, queries: List[List[int]], k: int) -> List[int]:
heap = []
result = []
for q in queries:
d = abs(q[0]) + abs(q[1])
if len(heap) < k:
heapq.heappush(heap, -d)
else:
if -heap[0] > d:
heapq.heapreplace(heap, -d)
if len(heap) < k:
result.append(-1)
else:
result.append(-heap[0])
return result
Q3
不会
Q4
不会