📈
notes
Search...
Ctrl + K
1711_Count_Good_Meals
Solution1 hash
时间复杂度 O(n)
空间复杂度 O(n)
可以看成是 two sum 的升级版,只是 sum 是 power of 2
Previous
1711_Count_Good_Meals
Next
1720_Decode_XORed_Array
Last updated
3 years ago