Lexicographical Numbers

字典排序是按照10进制的各个位排的，我跑去排二进制的各个位去了，o(╯□╰)o

官方discuss的代码循环里if   else剪枝设计的太精巧了，记录一下

class Solution {
public:
	vector<int> lexicalOrder(int n) {
		vector<int> res(n);
		int cur = 1;
		for (int i = 0; i < n; ++i) {
			res[i] = cur;
			if (cur * 10 <= n) {
				cur *= 10;
			}
			else {
				if (cur >= n) cur /= 10;
				cur += 1;
				while (cur % 10 == 0) cur /= 10;
			}
		}
		return res;
	}
};