Commit98f419f

committed

update: README

1 parentef80af0 commit98f419fCopy full SHA for 98f419f

File tree

+13

-1

lines changed

+13

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`4`	`4`
`5`	`5`	`ATTENTION: If you also use JavaScript as your coding language, you should pay attention to some JavaScript INTERNAL issues, such as bitwise operators, so as to let you not drop into some trouble which may be caused by JavaScript itself.`
`6`	`6`
`7`		`-Progress:152 Solutions`
	`7`	`+Progress:156/2520 Solutions`
`8`	`8`
`9`	`9`	`\| ID\| Title\| Solution\| Difficulty\|`
`10`	`10`	`\|-----\|-------------------------------------------------------------------------------------------------------------------------------------------------\|-----------------------------------------------------------------------------------------------------------------------\|------------\|`

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,8 @@`
	`1`	`+/**`
	`2`	`+ * 迭代法或者递归法均可实现，本实现为递归法`
	`3`	`+ *@param x`
	`4`	`+ *@param n`
	`5`	`+ */`
`1`	`6`	`functionmyPow(x:number,n:number):number{`
`2`	`7`	`if(n===0){`
`3`	`8`	`return1;`

Lines changed: 7 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,6 +11,9 @@ class ListNode {`
`11`	`11`	`}`
`12`	`12`	`}`
`13`	`13`
	`14`	`+/**`
	`15`	`+ * 迭代法或者递归法均可实现，本实现为迭代法`
	`16`	`+ */`
`14`	`17`	`functionswapPairs(head:ListNode\|null):ListNode\|null{`
`15`	`18`	`if(!head?.next){`
`16`	`19`	`returnhead;`
`@@ -39,6 +42,10 @@ function swapPairs(head: ListNode \| null): ListNode \| null {`
`39`	`42`	`returnresult;`
`40`	`43`	`};`
`41`	`44`
	`45`	`+/**`
	`46`	`+ * 递归法`
	`47`	`+ *@param head`
	`48`	`+ */`
`42`	`49`	`functionswapPairs2(head:ListNode\|null):ListNode\|null{`
`43`	`50`	`if(!head?.next){`
`44`	`51`	`returnhead;`

Comments

(0)