update: README

Author: hijiangtao

README.md

@@ -4,7 +4,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 
 **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.
 
-**Progress: 152 Solutions**
+**Progress: 156/2520 Solutions**
 
 | ID | Title | Solution | Difficulty |
 |-----|-------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------|------------|

src/powx-n/res.ts

@@ -1,3 +1,8 @@
+/**
+* 迭代法或者递归法均可实现，本实现为递归法
+* @param x
+* @param n
+*/
 function myPow(x: number, n: number): number {
 if (n === 0) {
 return 1;

src/swap-nodes-in-pairs/res.ts

@@ -11,6 +11,9 @@ class ListNode {
 }
 }
 
+/**
+* 迭代法或者递归法均可实现，本实现为迭代法
+*/
 function swapPairs(head: ListNode | null): ListNode | null {
 if (!head?.next) {
 return head;
@@ -39,6 +42,10 @@ function swapPairs(head: ListNode | null): ListNode | null {
 return result;
 };
 
+/**
+* 递归法
+* @param head
+*/
 function swapPairs2(head: ListNode | null): ListNode | null {
 if (!head?.next) {
 return head;