Leetcode Problem 397. Integer Replacement

397. Integer Replacement

Leetcode Solutions

Initialize a counter to keep track of the number of operations.
While n is not equal to 1: a. If n is even, divide it by 2 using right shift operation. b. If n is odd and not equal to 3, check the second least significant bit: i. If it is 0 (binary ends with '01'), decrement n. ii. If it is 1 (binary ends with '11'), increment n. c. If n is 3, decrement n. d. Increment the counter.
Return the counter.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen