- 浏览: 130686 次
文章分类
- 全部博客 (189)
- Tree (14)
- Dynamic Programming (34)
- Array (20)
- Search (1)
- Hash (12)
- Backtracking (22)
- Divide and Conque (8)
- Greedy (6)
- Stack (12)
- software (0)
- List (7)
- Math (22)
- Two pointers (16)
- String (20)
- Linux (1)
- Sliding Window (4)
- Finite State Machine (1)
- Breadth-first Search (7)
- Graph (4)
- DFS (6)
- BFS (3)
- Sort (9)
- 基础概念 (2)
- 沟通表达 (0)
- Heap (2)
- Binary Search (15)
- 小结 (1)
- Bit Manipulation (8)
- Union Find (4)
- Topological Sort (1)
- PriorityQueue (1)
- Design Pattern (1)
- Design (1)
- Iterator (1)
- Queue (1)
最新评论
-
likesky3:
看了数据结构书得知并不是迭代和递归的区别,yb君的写法的效果是 ...
Leetcode - Graph Valid Tree -
likesky3:
迭代和递归的区别吧~
Leetcode - Graph Valid Tree -
qb_2008:
还有一种find写法:int find(int p) { i ...
Leetcode - Graph Valid Tree -
qb_2008:
要看懂这些技巧的代码确实比较困难。我是这么看懂的:1. 明白这 ...
Leetcode - Single Num II -
qb_2008:
public int singleNumber2(int[] ...
Leetcode - Single Num II
Leetcode - Strobogrammatic Number III
- 博客分类:
- Math
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", high = "100", return 3. Because 69, 88, and 96 are three strobogrammatic numbers.
Note:
Because the range might be a large number, the low and high numbers are represented as string.
[分析]
思路1:比较容易想到的思路,利用题II的思路构造出low.length 和high.length之间的所有strobogrammatic number, 然后计数在low-high范围内的那些数字个数。
思路2:参考https://leetcode.com/discuss/50624/clean-and-easy-understanding-java-solution 在构造过程中判断并计数,且构造方式是从两边往中间,而思路1是从中间忘两边。在leetcode的运行时间优于思路1
思路3:受思路2启发,改造思路1,也在构造过程中判断,修改过程各种bug调试好久,而且运行时间远高于思路1和思路2,无言~
Write a function to count the total strobogrammatic numbers that exist in the range of low <= num <= high.
For example,
Given low = "50", high = "100", return 3. Because 69, 88, and 96 are three strobogrammatic numbers.
Note:
Because the range might be a large number, the low and high numbers are represented as string.
[分析]
思路1:比较容易想到的思路,利用题II的思路构造出low.length 和high.length之间的所有strobogrammatic number, 然后计数在low-high范围内的那些数字个数。
思路2:参考https://leetcode.com/discuss/50624/clean-and-easy-understanding-java-solution 在构造过程中判断并计数,且构造方式是从两边往中间,而思路1是从中间忘两边。在leetcode的运行时间优于思路1
思路3:受思路2启发,改造思路1,也在构造过程中判断,修改过程各种bug调试好久,而且运行时间远高于思路1和思路2,无言~
public class Solution { // Method 2: ref Map<Character, Character> map = new HashMap<>(); { map.put('1', '1'); map.put('8', '8'); map.put('6', '9'); map.put('9', '6'); map.put('0', '0'); } String low = "", high = ""; public int strobogrammaticInRange(String low, String high) { this.low = low; this.high = high; int result = 0; for(int n = low.length(); n <= high.length(); n++){ int[] count = new int[1]; strobogrammaticInRange(new char[n], count, 0, n-1); result += count[0]; } return result; } private void strobogrammaticInRange(char[] arr, int[] count, int lo, int hi){ if(lo > hi){ String s = new String(arr); if((arr[0] != '0' || arr.length == 1) && compare(low, s) && compare(s, high)){ count[0]++; } return; } for(Character c: map.keySet()){ arr[lo] = c; arr[hi] = map.get(c); if((lo == hi && c == map.get(c)) || lo < hi) strobogrammaticInRange(arr, count, lo+1, hi-1); } } private boolean compare(String a, String b){ if(a.length() != b.length()) return a.length() < b.length(); int i = 0; while(i < a.length() &&a.charAt(i) == b.charAt(i)) i++; return i == a.length() ? true: a.charAt(i) <= b.charAt(i); } // Method 1 public int strobogrammaticInRange1(String low, String high) { int count = 0; int minLen = low.length(), maxLen = high.length(); for (int n = minLen; n <= maxLen; n++) { List<String> candidates = recur(n, n); if (n == minLen || n == maxLen) { for (String cand : candidates) { if (isLess(low, cand) && isLess(cand, high)) count++; } } else { count += candidates.size(); } } return count; } public List<String> recur(int k, int n) { List<String> result = new ArrayList<String>(); if (k <= 0) { result.add(""); return result; } if (k == 1) { result.add("0"); result.add("1"); result.add("8"); return result; } List<String> subResult = recur(k - 2, n); for (String substr : subResult) { if (k < n) result.add('0' + substr + '0'); result.add('1' + substr + '1'); result.add('8' + substr + '8'); result.add('6' + substr + '9'); result.add('9' + substr + '6'); } return result; } private boolean isLess(String a, String b) { if (a.length() != b.length()) return a.length() <= b.length() ? true : false; int i = 0; while (i < a.length() && a.charAt(i) == b.charAt(i)) i++; return i == a.length() ? true : a.charAt(i) <= b.charAt(i); } }
public class Solution { // Method 3 String low = null, high = null; public int strobogrammaticInRange(String low, String high) { this.low = low; this.high = high; int count = 0; int minLen = low.length(), maxLen = high.length(); for (int n = minLen; n <= maxLen; n++) { List<String> candidates = recur(n, n, minLen, maxLen); count += candidates.size(); } return count; } Map<Character, Character> map = new HashMap<>(); { map.put('1', '1'); map.put('8', '8'); map.put('6', '9'); map.put('9', '6'); } public List<String> recur(int k, int n, int minLen, int maxLen) { List<String> result = new ArrayList<String>(); if (k <= 0) { result.add(""); return result; } if (k == 1) { if (k < n || isLessOrEqual(this.low, "0") && isLessOrEqual("0", this.high)) result.add("0"); if (k < n || isLessOrEqual(this.low, "1") && isLessOrEqual("1", this.high)) result.add("1"); if (k < n || isLessOrEqual(this.low, "8") && isLessOrEqual("8", this.high)) result.add("8"); return result; } List<String> subResult = recur(k - 2, n, minLen, maxLen); for (String substr : subResult) { if (k < n) result.add('0' + substr + '0'); for (Character c : map.keySet()) { String cand = c + substr + map.get(c); if (k == n) { if ((minLen < n && n < maxLen) || isLessOrEqual(this.low, cand) && isLessOrEqual(cand, this.high)) result.add(cand); } else { result.add(cand); } } } return result; } private boolean isLessOrEqual(String a, String b) { if (a.length() != b.length()) return a.length() <= b.length() ? true : false; int i = 0; while (i < a.length() && a.charAt(i) == b.charAt(i)) i++; return i == a.length() ? true : a.charAt(i) <= b.charAt(i); } }
发表评论
-
Leetcode - Integer to English Words
2015-09-04 20:53 1065[分析] 这题通过率之所以非常低是因为有很多corner ca ... -
Leetcode - Basic Calculator II
2015-08-27 09:16 865mplement a basic calculator to ... -
Leetcode - Factorial Trailing Zeroes
2015-08-25 09:00 396[思路] 数乘积结果的后缀0,其实就是数结果中有多少个因子10 ... -
Leetcode - Ugly Number II
2015-08-24 22:54 1119[分析] 暴力的办法就是从1开始检查每个数是否是丑数,发现丑数 ... -
Leetcode - Excel Sheet Column Title
2015-08-24 10:24 612[分析] 十进制转26进制,需要注意的是26进制是以1为最小数 ... -
Leetcode - Max Points on a Line
2015-08-23 15:30 671[分析] 两条直线若包含一个公共点且斜率相同,则为同一条直线。 ... -
Leetcode - Fraction to Recurring Decimal
2015-08-23 10:05 433[分析] 处理int型整数运算时,为避免溢出,省事的做法就是内 ... -
Leetcode - Count Primes
2015-08-22 13:42 478[ref] https://en.wikipedia.org/ ... -
Leetcode - Strobogrammatic Number
2015-08-22 10:48 1062A strobogrammatic number is a n ... -
Leetcode - Add Binary
2015-08-21 09:28 434[分析] 从低位往高位逐位相加,就是这么一个简单的题却花了我一 ... -
Leetcode - Rotate Image
2015-08-19 19:51 466[分析] 自己的思路:从外到内一圈圈顺时针旋转90度,坐标映射 ... -
Missing Ranges
2015-08-19 09:48 485[分析] 此题若不考虑极大值极小值相关的corner case ... -
Leetcode - Bitwise AND of Number Range
2015-08-17 09:41 467Given a range [m, n] where 0 &l ... -
Leetcode - Pow(x, n)
2015-08-11 09:45 434[分析] 数值计算类型题目,二分法或者借助位运算,本题两种方法 ... -
Leetcode - Divide Two Integers
2015-08-11 09:00 415[分析] 不能使用乘、除、取模运算,直接的思路当然是一次减一 ... -
Leetcode - sqrt(x)
2015-08-10 21:40 774[分析] 这是一道数值计算的题目,Code Ganker中指出 ... -
Leetcode - Permutation Sequence
2015-08-01 17:19 483原题链接:https://leetcode.com/probl ... -
Leetcode - Next Permutation
2015-08-01 16:38 659原题链接:https://leetcode.com/probl ... -
Leetcode - Multiply String
2015-06-15 09:39 641Given two numbers represented a ... -
Leetcode - Calculator
2015-06-10 09:31 508[分析] 思路1:逆序遍历字符串,数字和右括号保存在一个堆栈s ...
相关推荐
《leetcode-solutions》,刷算法题,需要有一定的英文阅读能力。。。
Algorithm-LeetCode-Sol-Res.zip,干净,易懂的解决方案和资源,为leetcode在线判断算法问题。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
IDEA 插件,lettcode刷题,leetcode-editor7.4版本下载进行本地导入(直接将压缩包拖进IDEA即可)
Algorithm-leetcode-spider.zip,leetcode公司,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
leetcode-cli-plugins leetcode-cli 的第 3 方插件。 什么是 如何使用 如何使用 插件 名称 描述 增强的命令 按公司或标签过滤问题 list 不要在同一台计算机上使 Chrome 的会话过期 login 不要在同一台计算机上使 ...
在IDE中解决LeetCode问题,支持leetcode.com与leetcode-cn.com,满足基本的做题需求。 理论上支持: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio。
解题思路思路和LeetCode-python 503.下一个更大元素 II一致,只是这里求的是下标的距离,而不是数值倒序搜索,用到栈,栈里存储索引情况1:若栈为
leetcode 答案解析 golang解答
leetcode-cheat 的发布 它是什么 ? 这是一个chrome 扩展,可以帮助您更高效地使用 leetcode。您可以从 重要: leetcode-cheat 现在只支持中文版。 也就是说不完全支持leetcode.com,但是你可以用leetcode-cn.com代替...
leetcode-editor,在ide中做leetcode练习,支持leetcode.com和leetcode-cn.com,以满足练习的基本需求。理论上支持:intellij idea phpstorm webstorm pycharm rubymine appcode clion goland datagrip rider mps ...
~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/vsc-leetcode-cli/bin/leetcode /usr/local/bin/leetcode 修改模板 open ~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/...
970. 强整数对数运算function powerfulIntegers(x: number, y: number, bound: number): numb
leetcode-helper-1.7.1
leetcode-tag-dynamic programming
然后进入到LeetCode-Spider目录中修改config.json,其中outputDir需要填写该工程的/docs/views文件夹路径 { "username": "aaa", "password": "bbb", "outputDir": "/Users/liuyao/Downloads/LeetCode-Blog-Test/docs...
leetcode-cli 注意:这个存储库是为了临时使用而分叉的。 注意:从 webbrowser 复制 cookie 并使用leetcode user -c可以临时修复不能。 一个享受 leetcode 的高效 cli 工具! 非常感谢 leetcode.com,一个非常棒的...
leetcode-tag-Tree
leetcode-tag-Stack
leetcode-tag-array