LeetCode258:Add Digits

最新推荐文章于 2024-09-27 18:24:26 发布

weixin_30604651

最新推荐文章于 2024-09-27 18:24:26 发布

阅读量56

点赞数

文章标签： runtime

原文链接：http://www.cnblogs.com/brucemengbm/p/6946241.html

版权

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.

For example:

Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.

Follow up:
Could you do it without any loop/recursion in O(1) runtime?

输入：1,2,3,4,5,6,7,8,9,10 11, 12, 13, 14, 15, 16， 17。 18， 19，20

结果：1, 2,3,4,5,6,7,8,9,1, 2, 3, 4, 5, 6, 。7， 8， 9， 1， 2

依据上面的尝试，我们能够发现，这里是有规律的。

即结果满足，（num-1）%9+1

	public static int addDigits(int num){
		return (num-1)%9+1;
	}

转载于:https://www.cnblogs.com/brucemengbm/p/6946241.html

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

weixin_30604651

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫

Leetcode 258: Add Digits

weixin_51401145的博客

06-08

问题描述： Given an integer num, repeatedly add all its digits until the result has only one digit, and return it. 如果num不是一位数，则将其每一位的数字累加，直到最终的累加和为一位数。 i.e. 976->22->4 代码如下： class Solution { public int addDigits(int num) { while(num>=10){

LeetCode 258: Add Digits 题解

请叫我AXin

08-18

867

刚开始以为是一道水题，一下就过了，结果题没看完，要求时间复杂度为O(1)O(1)。LeetCode 258: Add Digits Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the pr

参与评论您还未登录，请先登录后发表或查看评论

leetcode 258: Add Digits

weixin_34054931的博客

07-04

Add Digits Total Accepted: 5383 Total Submissions: 11876 Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num =...

leetcode258: Add Digits

sinat_35425429的博客

10-23

183

要求：将一个非负整数，分别将它每一位相加，直到结果只有一位数。例如：38->3+8=11->1+1=2 输出应当为2 最常见的解法：too naive public static int addDigits(int num) { if (num / 10 == 0) return num; while (num / 10 != 0) num = num / 10

leetcode 258 ：Add Digits

l3368bcttqnqn的博客

09-30

278

1、原题如下 Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one

Leetcode 258:Add Digits

Code_J_xer的博客

07-18

383

258： Add Digits Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has o

LeetCode 258 : Add Digits

shensccs的专栏

09-15

406

还是用求余和整型的除法得到每一位的数字，然后用递归去算出只有个位数的结果。 class Solution { public: int addDigits(int num) { int sum=0; while(num){ sum=sum+num%10; num=num/10; }

LeetCode 258:Add Digits

henryzhihua

12-06

530

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has on

Leetcode 258. Add Digits

小白菜又菜

06-03

118

【代码】Leetcode 258. Add Digits。

leetcode题目之Add Digits（非负整数各位相加）

01-05

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.

leetcode双人赛-java_leetcode:java打印letcode

06-30

digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. 新建一个链表，同时向后遍历两个链表，将他们的value相加 Given a ...

leetcode第321题-LeetCode-java:刷leetcode上面的题,用java语言写的

07-06

digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 题目3 ...

leetcode 2: Add Two Numbers (C#语言版）

hellowangxyue的专栏

04-11

748

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link

C语言刷题 LeetCode 30天挑战（一）

weixin_64593595的博客

09-24

406

C语言刷题 LeetCode 30天挑战（一）

day18-API(Math System Runtime Object BigInteger BigDecimal)

2303_79357053的博客

09-23

549

extends T> supplier) // 检查对象是否不为null，如果不为null，返回该对象；public static T requireNonNullElse(T obj, T defaultObj) // 检查对象是否不为null，如果不为null，返回该对象；比较内存地址值一般情况下是没有意义的，我们希望比较的是对象的属性，如果两个对象的属性相同，我们认为就是同一个对象；那么要比较对象的属性，我们就需要在Student类中重写Object类中的equals方法。

鸿蒙开发（NEXT/API 12）【基础功能（Function Flow Runtime 开发）】任务并发调度

鸿蒙的技术博客

09-24

1144

Function Flow编程模型是一种基于任务和数据驱动的并发编程模型，允许开发者通过任务及其依赖关系描述的方式进行应用开发。FFRT（Function Flow运行时）是支持Function Flow编程模型的软件运行时库，用于调度执行开发者基于Function Flow编程模型开发的应用。通过Function Flow编程模型和FFRT，开发者可专注于应用功能开发，由FFRT在运行时根据任务依赖状态和可用执行资源自动并发调度和执行任务。

iOS OC 底层原理之 category、load、initialize

xymspace

09-23

1211

不能直接添加成员变量，但能通过runtime间接添加。property在category中只生成setter和getter方法声明。

java中的四种引用