Problem
A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).
Write a function to determine if a number is strobogrammatic. The number is represented as a string.
Example 1:
Input: "69"
Output: true
Example 2:
Input: "88"
Output: true
Example 3:
Input: "962"
Output: false
class Solution { public boolean isStrobogrammatic(String s) { //69, 88, 00, 11, 6969, 698869, 69869, 6908069, 886988 Mapmap = new HashMap<>(); map.put("6", "9"); map.put("9", "6"); map.put("0", "0"); map.put("1", "1"); map.put("8", "8"); int i = 0, j = s.length()-1; while (i <= j) { if (!map.containsKey(s.charAt(i))) return false; if (map.get(s.charAt(i++)) != s.charAt(j--)) return false; } return true; } }
文章版权归作者所有,未经允许请勿转载,若此文章存在违规行为,您可以联系管理员删除。
转载请注明本文地址:https://www.ucloud.cn/yun/77259.html
摘要:题目解答题目解答先考虑最底层的两种情况,当和当的时候,就是最中间的数为空还是存在唯一的一个数。然后我们在这个基础上,用循环两个数两个数地一起向外扩张。扩张后的结果存在里,作为再服务于上一层的扩张,得到最终结果。 246.Strobogrammatic NumberI题目:A strobogrammatic number is a number that looks the same w...
摘要:比如,先判断和是有映射的,然后和自己又是映射,所以是对称数。这样每次从中间插入两个对称的字符,之前插入的就被挤到两边去了。只插入一个字符时不能插入和插入字符和它的对应字符 Strobogrammatic Number I A strobogrammatic number is a number that looks the same when rotated 180 degrees ...
Problem A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Find all strobogrammatic numbers that are of length = n. Example: Input: n = 2Output...
Problem A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Write a function to count the total strobogrammatic numbers that exist in the range o...
摘要:题目链接这题和都可以做,一种思路就是从中间开始往两边延伸,每次有种可能性和,其中开头处不能是。可以加或者用优化。 247. Strobogrammatic Number II 题目链接:https://leetcode.com/problems... 这题recursion和iteration都可以做,一种思路就是从中间开始往两边延伸,每次c[i-k], c[i+k]有5种可能性: (...
阅读 4138·2021-09-24 09:47
阅读 1131·2021-09-03 10:33
阅读 2030·2019-08-30 11:13
阅读 995·2019-08-30 10:49
阅读 1723·2019-08-29 16:13
阅读 1979·2019-08-29 11:28
阅读 3062·2019-08-26 13:31
阅读 3577·2019-08-23 17:14