docs: 更新链表相关算法文档

Author: chufan

code/algorithm/interview-101/addInList.js

@@ -0,0 +1,18 @@
+/*
+ * function ListNode(x){
+ *   this.val = x;
+ *   this.next = null;
+ * }
+ */
+/**
+ *
+ * @param head1 ListNode类
+ * @param head2 ListNode类
+ * @return ListNode类
+ */
+function addInList(head1, head2) {
+  // write code here
+}
+module.exports = {
+  addInList
+}

code/algorithm/interview-101/deleteDuplicates-1.js

@@ -0,0 +1,14 @@
+/*
+ * function ListNode(x){
+ *   this.val = x;
+ *   this.next = null;
+ * }
+ */
+/**
+ *
+ * @param head ListNode类
+ * @return ListNode类
+ */
+function deleteDuplicatesOne(head) {
+  // write code here
+}

code/algorithm/interview-101/deleteDuplicates-2.js

@@ -0,0 +1,14 @@
+/*
+ * function ListNode(x){
+ *   this.val = x;
+ *   this.next = null;
+ * }
+ */
+/**
+ *
+ * @param head ListNode类
+ * @return ListNode类
+ */
+function deleteDuplicatesTwo(head) {
+  // write code here
+}

code/algorithm/interview-101/isPail.js

@@ -0,0 +1,17 @@
+/*
+ * function ListNode(x){
+ *   this.val = x;
+ *   this.next = null;
+ * }
+ */
+/**
+ *
+ * @param head ListNode类 the head
+ * @return bool布尔型
+ */
+function isPail(head) {
+  // write code here
+}
+module.exports = {
+  isPail
+}

code/algorithm/interview-101/oddEvenList.js

@@ -0,0 +1,17 @@
+/*
+ * function ListNode(x){
+ *   this.val = x;
+ *   this.next = null;
+ * }
+ */
+/**
+ *
+ * @param head ListNode类
+ * @return ListNode类
+ */
+function oddEvenList(head) {
+  // write code here
+}
+module.exports = {
+  oddEvenList
+}

code/algorithm/interview-101/sortInList.js

@@ -0,0 +1,16 @@
+/*
+ * function ListNode(x){
+ *   this.val = x;
+ *   this.next = null;
+ * }
+ */
+/**
+ * @param head ListNode类 the head node
+ * @return ListNode类
+ */
+function sortInList(head) {
+  // write code here
+}
+module.exports = {
+  sortInList
+}