資訊專欄INFORMATION COLUMN
Problem
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
ExampleGiven num = 38.
The process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return 2.
Could you do it without any loop/recursion in O(1) runtime?
Solutionpublic class Solution {
/*
* @param num: a non-negative integer
* @return: one digit
*/
public int addDigits(int num) {
// write your code here
if (num < 10) return num;
int sum = 0;
while (num != 0) {
sum += (num%10);
num /= 10;
}
return addDigits(sum);
}
}
public class Solution {
/*
* @param num: a non-negative integer
* @return: one digit
*/
public int addDigits(int num) {
// write your code here
while (num >= 10) {
String cur = Integer.toString(num);
int sum = 0;
for (int i = 0; i < cur.length(); i++) {
sum += Character.getNumericValue(cur.charAt(i));
}
num = sum;
}
return num;
}
}
文章版權(quán)歸作者所有，未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請注明本文地址：http://systransis.cn/yun/68260.html
Problem Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. Example Given [1,2...
Problem Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2. Notice The length of both num1 and num2 is < 5100.Both num1 and num2 contains only digits ...
摘要：題意為取刪去個字符后最小的值，仍以返回。所以無論刪除個元素之后的元素放入順序如何，此時棧內(nèi)元素從底到頂?shù)呐帕幸欢ㄊ菨M足條件的最小值。這種情況下，就要從堆棧頂部刪除剩下的兩個元素和然后，將棧內(nèi)的元素放入，并將頂部的全部去掉，然后以返回。 Problem Given string A representative a positive integer which has N digits,...
Problem You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1s digit is at the head of the list. Write a f...
摘要：只有當位數(shù)時，才打印數(shù)字。首先分析邊界，應(yīng)該，然后用存最高位。用函數(shù)對進行遞歸運算，同時更新結(jié)果數(shù)組。更新的過程歸納一下，首先，計算最高位存入，然后，用到倍的和之前里已經(jīng)存入的所有的數(shù)個循環(huán)相加，再存入，更新，計算更高位直到等于 Problem Print numbers from 1 to the largest number with N digits by recursion. ...
閱讀 1406·2021-11-08 13:14
閱讀 760·2021-09-23 11:31
閱讀 1051·2021-07-29 13:48
閱讀 2789·2019-08-29 12:29
閱讀 3384·2019-08-29 11:24
閱讀 1910·2019-08-26 12:02
閱讀 3702·2019-08-26 10:34
閱讀 3447·2019-08-23 17:07
