首页 > 其他 > 详细

lexicographical-numbers

时间:2016-08-29 01:37:28      阅读:164      评论:0      收藏:0      [点我收藏+]
https://leetcode.com/problems/lexicographical-numbers/

public class Solution {
    public List<Integer> lexicalOrder(int n) {
        List<Integer> ret = new ArrayList<Integer>();
        int cur = 1;
        ret.add(cur);
        
        while (cur > 0) {
            if (cur * 10 <= n) {
                cur *= 10;
                ret.add(cur);
                continue;
            }
            while (cur % 10 == 9) {
                cur /= 10;
            }
            if (cur == 0) {
                break;
            }
            if (cur + 1 <= n) {
                cur++;
                ret.add(cur);
            }
            else {
                cur /= 10;
                while (cur % 10 == 9) {
                    cur /= 10;
                }
                if (cur == 0) {
                    break;
                }
                cur++;
                ret.add(cur);
            }
        }
        
        return ret;
    }
}

 

lexicographical-numbers

原文:http://www.cnblogs.com/charlesblc/p/5816462.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!