Leetcode Problem 1056. Confusing Number

1056. Confusing Number

Leetcode Solutions

Approach: Invert and Reverse

  1. Create a hashmap invertMap that maps 0 to 0, 1 to 1, 6 to 9, 8 to 8, and 9 to 6.
  2. Convert the integer n to a string str_n.
  3. Initialize an empty string rotatedNumber.
  4. Iterate over each digit digit in str_n. a. If digit is not in invertMap, return false. b. Append invertMap[digit] to rotatedNumber.
  5. Reverse rotatedNumber.
  6. Compare the reversed rotatedNumber with str_n. a. If they are equal, return false. b. Otherwise, return true.
UML Thumbnail

Approach: Use the Remainder

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...