We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0fea67e commit ccc4a2eCopy full SHA for ccc4a2e
solution/0400-0499/0400.Nth Digit/Solution.java
@@ -6,18 +6,17 @@ public int findNthDigit(int n) {
6
* 举例15,15-9=6,6/2=3...0,余数是0,那么这个数值value=10*(2-1)+(3-1)=12,整除取最后一位 12%10=2
7
* 举例14,14-9=5,5/2=2...1,余数不为0,那么这个数值value=10*(2-1)+2=12,则为这个数的第余数个 12/(10*(2-1))%10=1
8
*/
9
- long max=9;
10
- long num=n;
11
- long digits=1;
12
- while (n>0) {
13
- if(num-max*digits>0) {
14
- num=num-max*digits;
+ long max = 9;
+ long num = n;
+ long digits = 1;
+ while (n > 0) {
+ if(num - max * digits > 0) {
+ num = num - max * digits;
15
digits++;
16
- max=max*10;
17
- }else {
18
- long count=num/digits;
19
- long childDigits=num%digits;
20
- long value=(long)Math.pow(10,digits-1)+count-1;
+ max = max * 10;
+ } else {
+ long count = num / digits;
+ long childDigits = num % digits;
21
if (childDigits == 0) {
22
return (int) (((long) Math.pow(10, digits - 1) + count - 1) % 10);
23
} else {
@@ -26,6 +25,5 @@ public int findNthDigit(int n) {
26
25
}
27
28
return 0;
29
-
30
31
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments