maths/persistence.py · July1921/Algorithms-Python

代码拉取完成,页面将自动刷新

扫描微信二维码支付

取消

支付完成

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 1

July1921/Algorithms-Python

代码 Issues 0 Pull Requests 1 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (10)

管理

master

pre-commit-ci-update-config

Python-3.14

uv-again

gh-pages

cclauss-patch-2

Fewer-forward-propogations-to-speed-tests

Python-3.12-on-Debian-bookworm

fix-maclaurin_series-on-Python3.12

quantum_random.py.disabled

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 10

标签 0

Algorithms-Python

maths

persistence.py

persistence.py 2.10 KB

def multiplicative_persistence(num: int) -> int:
 """
 Return the persistence of a given number.

https://en.wikipedia.org/wiki/Persistence_of_a_number

>>> multiplicative_persistence(217)
 2
 >>> multiplicative_persistence(-1)
 Traceback (most recent call last):
 ...
 ValueError: multiplicative_persistence() does not accept negative values
 >>> multiplicative_persistence("long number")
 Traceback (most recent call last):
 ...
 ValueError: multiplicative_persistence() only accepts integral values
 """

if not isinstance(num, int):
 raise ValueError("multiplicative_persistence() only accepts integral values")
 if num < 0:
 raise ValueError("multiplicative_persistence() does not accept negative values")

steps = 0
 num_string = str(num)

while len(num_string) != 1:
 numbers = [int(i) for i in num_string]

total = 1
 for i in range(len(numbers)):
 total *= numbers[i]

num_string = str(total)

steps += 1
 return steps

def additive_persistence(num: int) -> int:
 """
 Return the persistence of a given number.

https://en.wikipedia.org/wiki/Persistence_of_a_number

>>> additive_persistence(199)
 3
 >>> additive_persistence(-1)
 Traceback (most recent call last):
 ...
 ValueError: additive_persistence() does not accept negative values
 >>> additive_persistence("long number")
 Traceback (most recent call last):
 ...
 ValueError: additive_persistence() only accepts integral values
 """

if not isinstance(num, int):
 raise ValueError("additive_persistence() only accepts integral values")
 if num < 0:
 raise ValueError("additive_persistence() does not accept negative values")

steps = 0
 num_string = str(num)

while len(num_string) != 1:
 numbers = [int(i) for i in num_string]

total = 0
 for i in range(len(numbers)):
 total += numbers[i]

num_string = str(total)

steps += 1
 return steps

if __name__ == "__main__":
 import doctest

doctest.testmod()

一键复制编辑原始数据按行查看历史

pre-commit-ci[bot] 提交于 2023年08月29日 21:18 +08:00 . [pre-commit.ci] pre-commit autoupdate (#9013)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82

def multiplicative_persistence(num: int) -> int:
 """
 Return the persistence of a given number.

 https://en.wikipedia.org/wiki/Persistence_of_a_number

 >>> multiplicative_persistence(217)
 2
 >>> multiplicative_persistence(-1)
 Traceback (most recent call last):
 ...
 ValueError: multiplicative_persistence() does not accept negative values
 >>> multiplicative_persistence("long number")
 Traceback (most recent call last):
 ...
 ValueError: multiplicative_persistence() only accepts integral values
 """

 if not isinstance(num, int):
 raise ValueError("multiplicative_persistence() only accepts integral values")
 if num < 0:
 raise ValueError("multiplicative_persistence() does not accept negative values")

 steps = 0
 num_string = str(num)

 while len(num_string) != 1:
 numbers = [int(i) for i in num_string]

 total = 1
 for i in range(len(numbers)):
 total *= numbers[i]

 num_string = str(total)

 steps += 1
 return steps


def additive_persistence(num: int) -> int:
 """
 Return the persistence of a given number.

 https://en.wikipedia.org/wiki/Persistence_of_a_number

 >>> additive_persistence(199)
 3
 >>> additive_persistence(-1)
 Traceback (most recent call last):
 ...
 ValueError: additive_persistence() does not accept negative values
 >>> additive_persistence("long number")
 Traceback (most recent call last):
 ...
 ValueError: additive_persistence() only accepts integral values
 """

 if not isinstance(num, int):
 raise ValueError("additive_persistence() only accepts integral values")
 if num < 0:
 raise ValueError("additive_persistence() does not accept negative values")

 steps = 0
 num_string = str(num)

 while len(num_string) != 1:
 numbers = [int(i) for i in num_string]

 total = 0
 for i in range(len(numbers)):
 total += numbers[i]

 num_string = str(total)

 steps += 1
 return steps


if __name__ == "__main__":
 import doctest

 doctest.testmod()