[Swift]LeetCode247.对称数 II $ Strobogrammatic Number II

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.

For example,
Given n = 2, return ["11","69","88","96"].

Hint:

  1. Try to use recursion and notice that it should recurse with n - 2 instead of n - 1.


strobogramatic数字是旋转180度时看起来相同的数字(上下颠倒)。

找到所有长度为n的频闪图。

例如,

给定n=2,返回 [“11”,“69”,“88”,“96”]。

提示:

尝试使用递归,注意它应该使用n-2而不是n-1进行递归。


 1 class Solution {
 2     func shortest(_ n:Int) -> [String] {
 3         var one:[String] = ["0","1","8"]
 4         var two:[String] = [String]()
 5         var res:[String] = two
 6         if n % 2 == 1
 7         {
 8             res = one
 9         }
10         for i in stride(from: (n % 2) + 2,through: n,by: 2)
11         {
12             var t:[String] = [String]()
13             for a in res
14             {
15                 if i != n
16                 {
17                     t.append("0" + a + "0")
18                 }
19                 t.append("1" + a + "1")
20                 t.append("6" + a + "9")
21                 t.append("8" + a + "8")
22                 t.append("9" + a + "6")
23             }
24             res = t
25         }
26         return res
27     }
28 }

原文地址:https://www.cnblogs.com/strengthen/p/10214391.html

时间: 2024-10-12 08:05:10

[Swift]LeetCode247.对称数 II $ Strobogrammatic Number II的相关文章

[LeetCode] 247. Strobogrammatic Number II 对称数II

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. For example,Given n = 2, return ["11","69","88","96"

LeetCode Strobogrammatic Number II

原题链接在这里:https://leetcode.com/problems/strobogrammatic-number-ii/ 题目: 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. For example,Given

[LeetCode#247] Strobogrammatic Number II

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. For example,Given n = 2, return ["11","69","88",&quo

Strobogrammatic Number II -- LeetCode

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. For example,Given n = 2, return ["11","69","88","96"

247. Strobogrammatic Number II

写的时候有点困了,0那里没有处理好 1 public List<String> findStrobogrammatic(int n) { 2 List<String> tmp = helper(n); 3 List<String> res = new ArrayList<String>(); 4 if(n == 1) { 5 return tmp; 6 } 7 String allZeroes = ""; 8 for(String eac

[LeetCode] 246. Strobogrammatic Number 对称数

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. For example, the numbers "69", "

[LeetCode] 248. Strobogrammatic Number III 对称数III

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 of low <= num <= high. For example,Given low = "50&qu

Strobogrammatic Number

Strobogrammatic Number I 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. For example, the

248. Strobogrammatic Number III

题目: 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 of low <= num <= high. For example,Given low = "5