feat: add js and ts solutions to locf problem: No.06. Reverse Print (#424)

Author: zhaocchen

lcof/面试题06. 从尾到头打印链表/README.md

@@ -101,6 +101,30 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {number[]}
+ */
+var reversePrint = function(head) {
+    let res = [];
+    while (head != null) {
+        res.unshift(head.val);
+        head = head.next;
+    }
+    return res;
+};
+```
+
 ### **Go**
 
 ```go
@@ -179,6 +203,31 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+ function reversePrint(head: ListNode | null): number[] {
+    let res: number[] = [];
+    while (head != null) {
+        res.unshift(head.val);
+        head = head.next;
+    }
+    return res;
+};
+```
+
 ### **...**
 
 ```

lcof/面试题06. 从尾到头打印链表/Solution.ts

@@ -0,0 +1,20 @@
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+ function reversePrint(head: ListNode | null): number[] {
+    let res: number[] = [];
+    while (head != null) {
+        res.unshift(head.val);
+        head = head.next;
+    }
+    return res;
+};