Commitd54abce

committed

fix: fix some

1 parent05de575 commitd54abceCopy full SHA for d54abce

File tree

+12

-10

lines changed

+12

-10

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-#[Longest Palindromic Substring][title]`
	`1`	`+#[ZigZag Conversion][title]`
`2`	`2`
`3`	`3`	`##Description`
`4`	`4`
`@@ -106,5 +106,5 @@ class Solution {`
`106`	`106`
`107`	`107`
`108`	`108`
`109`		`-[title]:https://leetcode.com/problems/longest-palindromic-substring`
	`109`	`+[title]:https://leetcode.com/problems/zigzag-conversion`
`110`	`110`	`[ajl]:https://github.com/Blankj/awesome-java-leetcode`

Lines changed: 9 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -42,14 +42,16 @@ class Solution {`
`42`	`42`	好好思考下是否需要计算整个长度，比如 1234321，其实不然，我们只需要计算一半的长度即可，就是在计算过程中的那个逆序数比不断除 10 的数大就结束计算即可，但是这也带来了另一个问题，比如 10 的倍数的数 10010，它也会返回`true`，所以我们需要对 10 的倍数的数再加个判断即可，代码如下所示。
`43`	`43`
`44`	`44`	```java
`45`		`-publicboolean isPalindrome(int x) {`
`46`		`-if (x<0\|\| (x!=0&& x%10==0))returnfalse;`
`47`		`-int halfReverseX=0;`
`48`		`-while (x> halfReverseX) {`
`49`		`- halfReverseX= halfReverseX*10+ x%10;`
`50`		`- x/=10;`
	`45`	`+classSolution {`
	`46`	`+publicbooleanisPalindrome(intx) {`
	`47`	`+if (x<0\|\| (x!=0&& x%10==0))returnfalse;`
	`48`	`+int halfReverseX=0;`
	`49`	`+while (x> halfReverseX) {`
	`50`	`+ halfReverseX= halfReverseX*10+ x%10;`
	`51`	`+ x/=10;`
	`52`	`+ }`
	`53`	`+return halfReverseX== x\|\| halfReverseX/10== x;`
`51`	`54`	`}`
`52`		`-return halfReverseX== x\|\| halfReverseX/10== x;`
`53`	`55`	`}`
`54`	`56`	```
`55`	`57`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -28,7 +28,7 @@ Explanation: The square root of 8 is 2.82842..., and since we want to return an`
`28`	`28`
`29`	`29`	`##思路`
`30`	`30`
`31`		`-题意是求平方根，参考[牛顿迭代法求平方根](https://wenku.baidu.com/view/6b74c622bcd126fff7050bfe.html)，然后再参考维基百科的[Integer square root](https://en.wikipedia.org/wiki/Integer_square_root#Using_only_integer_division)即可。`
	`31`	`+题意是求平方根，参考[牛顿迭代法求平方根](https://wenku.baidu.com/view/6b74c622bcd126fff7050bfe.html)，然后再参考维基百科的[Integer square root](https://en.wikipedia.org/wiki/Integer_square_root#Using_only_integer_division)即可。`
`32`	`32`
`33`	`33`	```java
`34`	`34`	`classSolution {`

Comments

(0)