Commitdad857b

committed

a new solution of 0

338

1 parent09cbb32 commitdad857bCopy full SHA for dad857b

File tree

+14

-0

lines changed

+14

-0

lines changed

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,3 +8,17 @@ def countBits(self, n: int) -> List[int]:`
`8`	`8`	`offset=i`
`9`	`9`	`dp[i]=1+dp[i-offset]`
`10`	`10`	`returndp`
	`11`	`+`
	`12`	`+# Another dp solution`
	`13`	`+classSolution2:`
	`14`	`+defcountBits(self,n:int)->List[int]:`
	`15`	`+res= [0]* (n+1)`
	`16`	`+foriinrange(1,n+1):`
	`17`	`+ifi%2==1:`
	`18`	`+res[i]=res[i-1]+1`
	`19`	`+else:`
	`20`	`+res[i]=res[i//2]`
	`21`	`+returnres`
	`22`	`+# This solution is based on the division of odd and even numbers.`
	`23`	`+# I think it's easier to understand.`
	`24`	`+# This is my full solution, covering the details: https://leetcode.com/problems/counting-bits/solutions/4411054/odd-and-even-numbers-a-easier-to-understanding-way-of-dp/`

Comments

(0)