Skip to content

Commit 3e069c6

SambacFeng SambacFeng

committed

更新 0202.快乐数

1 parent c911b6b commit 3e069c6Copy full SHA for 3e069c6

File tree

1 file changed

+18

-16

lines changed

problems
- 0202.快乐数.md

1 file changed

+18

-16

lines changed

`‎problems/0202.快乐数.md`

Lines changed: 18 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -159,26 +159,28 @@ func getSum(n int) int {`
`159`	`159`	`javaScript:`
`160`	`160`
`161`	`161`	```js
`162`		`-function getN(n) {`
`163`		`- if (n == 1 \|\| n == 0) return n;`
`164`		`- let res = 0;`
`165`		`- while (n) {`
`166`		`- res += (n % 10) * (n % 10);`
`167`		`- n = parseInt(n / 10);`
	`162`	`+var isHappy = function (n) {`
	`163`	`+ let m = new Map()`
	`164`	`+`
	`165`	`+ const getSum = (num) => {`
	`166`	`+ let sum = 0`
	`167`	`+ while (n) {`
	`168`	`+ sum += (n % 10) ** 2`
	`169`	`+ n = Math.floor(n / 10)`
	`170`	`+ }`
	`171`	`+ return sum`
`168`	`172`	`}`
`169`		`- return res;`
`170`		`-}`
`171`	`173`
`172`		`-var isHappy = function(n) {`
`173`		`- const sumSet = new Set();`
`174`		`- while (n != 1 && !sumSet.has(n)) {`
`175`		`- sumSet.add(n);`
`176`		`- n = getN(n);`
	`174`	`+ while (true) {`
	`175`	`+ // n出现过,证明已陷入无限循环`
	`176`	`+ if (m.has(n)) return false`
	`177`	`+ if (n === 1) return true`
	`178`	`+ m.set(n, 1)`
	`179`	`+ n = getSum(n)`
`177`	`180`	`}`
`178`		`- return n == 1;`
`179`		`-};`
	`181`	`+}`
`180`	`182`
`181`		`-// 使用环形链表的思想说明出现闭环退出循环`
	`183`	`+// 方法二:使用环形链表的思想说明出现闭环退出循环`
`182`	`184`	`var isHappy = function(n) {`
`183`	`185`	`if (getN(n) == 1) return true;`
`184`	`186`	`let a = getN(n), b = getN(getN(n));`

0 commit comments

Comments

(0)