386. Lexicographical Numbers

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