LeetCode

LeetCode copied to clipboard

//time: O(log(N)! * log(N)), space: O(log(N)) class Solution { public: void swap(vector& nums, int i, int j){ int t = nums[i]; nums[i] = nums[j]; nums[j] = t; }; bool isPowerOf2(vector&...

mkn-root12