Given an integern, return 1 -nin lexicographical order.
For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].
Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.
要注意的是while 這段增炭， 如果不加這段肺然， 就會把234等直接漏掉抖剿， 19包归，20于宙， ? ? 29，30枉疼，正確的應(yīng)該是
19润讥，2，20 ? ? ?29胧弛，3尤误，30
