[LeetCode]#2220. Minimum Bit Flips to Convert Number

Environment: Python 3.8

Key technique: XOR, count

A bit flip of a number x is choosing a bit in the binary representation of x and flipping it from either 0 to 1 or 1 to 0.

  • For example, for x = 7, the binary representation is 111 and we may choose any bit (including any leading zeros not shown) and flip it. We can flip the first bit from the right to get 110, flip the second bit from the right to get 101, flip the fifth bit from the right (a leading zero) to get 10111, etc.

Given two integers start and goal, return the minimum number of bit flips to convert start to goal.

Example 1:

Analysis:

  1. Use XOR to get output.
  2. Sum all ‘1’

Solution:

Submissions:

Reference:

https://leetcode.com/problems/minimum-bit-flips-to-convert-number/discuss/1907288/Python-Solution-or-One-liner

--

--

Interesting in any computer science.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store