让 n = 12345 ,其中 12345 是给定的输入。
rev = 0
Now in the first iteration of the while loop n > 0
dig = remainder of n divided by 10, So it is = 5
rev = rev(0) * 10 + dig(5) = 5
n = n // 10 = 1234
在第二次迭代中 n = 1234 > 0
rev = 5
dig = remainder of n divided by 10, So it is = 4
rev = rev(5) * 10 + dig(4) = 54
n = n // 10 = 123
在第三次迭代中,n = 123 > 0
rev = 54
dig = remainder of n divided by 10, So it is = 3
rev = rev(54) * 10 + dig(3) = 543
n = n // 10 = 12
在第四次迭代中,n = 12 > 0
rev = 543
dig = remainder of n divided by 10, So it is = 2
rev = rev(543) * 10 + dig(2) = 5432
n = n // 10 = 1
在第五次迭代中,n = 1 > 0
rev = 5432
dig = remainder of n divided by 10, So it is = 1
rev = rev(5432) * 10 + dig(1) = 54321
n = n // 10 = 0
现在在 while 循环的第六次迭代中 n = 0 所以它不大于 0 所以循环会中断并且你得到 rev = 54321