2022-05-27
Last updated
Last updated
Given an integer n
, return true
if it is a power of two. Otherwise, return false
.
An integer n
is a power of two, if there exists an integer x
such that n == 2x
.
Example 1:
Example 2:
Example 3:
Constraints:
-2^31 <= n <= 2^31 - 1
Follow up: Could you solve it without loops/recursion?
Note:
Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned.
Example 1:
Example 2:
Example 3:
Constraints:
The input must be a binary string of length 32
.
Follow up: If this function is called many times, how would you optimize it?
Given the coordinates of two rectilinear rectangles in a 2D plane, return the total area covered by the two rectangles.
The first rectangle is defined by its bottom-left corner (ax1, ay1)
and its top-right corner (ax2, ay2)
.
The second rectangle is defined by its bottom-left corner (bx1, by1)
and its top-right corner (bx2, by2)
.
Example 1:
Example 2:
Constraints:
-10^4 <= ax1, ay1, ax2, ay2, bx1, by1, bx2, by2 <= 10^4
Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the ).
In Java, the compiler represents the signed integers using . Therefore, in Example 3, the input represents the signed integer. -3
.