Number Complement – Leetcode

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation. Note: The given integer is guaranteed to fit within the range of a 32-bit signed integer. You could assume no leading zero bit in the integer’s binary representation. Example 1:

Example 2:


Read More

Max Consecutive Ones – Leetcode

Given a binary array, find the maximum number of consecutive 1s in this array. Example 1:

Note: The input array will only contain 0 and 1. The length of input array is a positive integer and will not exceed 10,000   Solution This is an easy to solve problem. We keep on counting the ones till a […]

Read More