LeetCode 386. Lexicographical Numbers
来源:互联网 发布:大数据经典案例 编辑:程序博客网 时间:2024/05/17 23:10
描述
把1~n的数,按字典序存进vector中
解决
遍历,可以不断乘以10,然后倒着加1,比如,n为101,就是1,10,100,101……….这样子
class Solution {public: vector<int> lexicalOrder(int n) { vector<int> res(n); int i = 0, val = 1; res[i++] = 1; while (i < n) { if (val * 10 <= n) { val *= 10; } else { while (val % 10 == 9 || val == n) val /= 10; ++val; } res[i++] = val; } return res; }};
0 0
- [leetcode] 386. Lexicographical Numbers
- [leetcode]386. Lexicographical Numbers
- 【Leetcode】386. Lexicographical Numbers
- [Leetcode]386. Lexicographical Numbers
- LeetCode 386. Lexicographical Numbers
- 【LeetCode】 386. Lexicographical Numbers
- [leetcode]386. Lexicographical Numbers
- LeetCode 386. Lexicographical Numbers
- LeetCode 386. Lexicographical Numbers
- [LeetCode]386. Lexicographical Numbers
- leetcode 386. Lexicographical Numbers
- LeetCode—386. Lexicographical Numbers
- LeetCode—386. Lexicographical Numbers
- 【LeetCode题解】386. Lexicographical Numbers
- LeetCode笔记:386. Lexicographical Numbers
- leetcode 386. Lexicographical Numbers 解题报告
- LeetCode-386. Lexicographical Numbers-思路详解-C++
- leetcode oj java 386. Lexicographical Numbers
- idea14+jrebel6.5.2实现热部署
- 本机与Linux服务器文件拷贝
- Ruby学习笔记(1) ————Linux下安装Ruby环境
- 利用Ajax Toolkit的AutoComplete实现模糊查询
- 第五组内部linux比赛命题
- LeetCode 386. Lexicographical Numbers
- Java NIO浅析
- Android Studio JNI开发(2)------NDK 编译原生库
- Go语言 数组(Array), 分片(Slice), Map 以及 Set
- Makefie 打印
- HDU 2031
- Servlet的一些总结
- GCD延时操作Dispatch_after swift写法
- ajax跨域调用(实例)