Commit514a64d

committed

refactor 172

1 parentf77624b commit514a64dCopy full SHA for 514a64d

File tree

+23

-26

lines changed

+23

-26

lines changed

Lines changed: 23 additions & 26 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,34 +1,31 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
	`2`	`+`
`2`	`3`	`/**`
`3`	`4`	`* 172. Factorial Trailing Zeroes`
`4`		`-`
`5`		`- Given an integer n, return the number of trailing zeroes in n!.`
`6`		`-`
`7`		`- Example 1:`
`8`		`-`
`9`		`- Input: 3`
`10`		`- Output: 0`
`11`		`- Explanation: 3! = 6, no trailing zero.`
`12`		`-`
`13`		`- Example 2:`
`14`		`-`
`15`		`- Input: 5`
`16`		`- Output: 1`
`17`		`- Explanation: 5! = 120, one trailing zero.`
`18`		`-`
`19`		`- Note: Your solution should be in logarithmic time complexity.`
`20`		`-`
	`5`	`+ *`
	`6`	`+ * Given an integer n, return the number of trailing zeroes in n!.`
	`7`	`+ *`
	`8`	`+ * Example 1:`
	`9`	`+ * Input: 3`
	`10`	`+ * Output: 0`
	`11`	`+ * Explanation: 3! = 6, no trailing zero.`
	`12`	`+ *`
	`13`	`+ * Example 2:`
	`14`	`+ * Input: 5`
	`15`	`+ * Output: 1`
	`16`	`+ * Explanation: 5! = 120, one trailing zero.`
	`17`	`+ * Note: Your solution should be in logarithmic time complexity.`
`21`	`18`	`*/`
`22`	`19`	`publicclass_172 {`
`23`	`20`
`24`		`-publicstaticclassSolution1 {`
`25`		`-publicinttrailingZeroes(intn) {`
`26`		`-intresult =0;`
`27`		`-while (n >4) {`
`28`		`-n /=5;`
`29`		`-result +=n;`
`30`		`- }`
`31`		`-returnresult;`
	`21`	`+publicstaticclassSolution1 {`
	`22`	`+publicinttrailingZeroes(intn) {`
	`23`	`+intresult =0;`
	`24`	`+while (n >4) {`
	`25`	`+n /=5;`
	`26`	`+result +=n;`
	`27`	`+ }`
	`28`	`+returnresult;`
	`29`	`+ }`
`32`	`30`	`}`
`33`		`- }`
`34`	`31`	`}`

Comments

(0)