feat: add java/python solution for lcof problem

Author: yanglbme

lcci/README.md

@@ -11,7 +11,10 @@
 │   ├── README.md
 │   ├── Solution.java
 │   └── Solution.py
-└── 面试题 01.02. 判定是否互为字符重排
+├── 面试题 01.02. 判定是否互为字符重排
+│   ├── README.md
+│   └── Solution.py
+└── 面试题 01.03. URL化
     ├── README.md
     └── Solution.py
 ```

lcof/README.md

@@ -7,8 +7,16 @@
 .
 ├── README.md
 ├── template.md
-└── 面试题03. 数组中重复的数字
+├── 面试题03. 数组中重复的数字
+│   ├── README.md
+│   └── Solution.py
+├── 面试题04. 二维数组中的查找
+│   ├── README.md
+│   ├── Solution.java
+│   └── Solution.py
+└── 面试题05. 替换空格
     ├── README.md
+    ├── Solution.java
     └── Solution.py
 ```
 

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

@@ -0,0 +1,64 @@
+# [面试题06. 从尾到头打印链表](https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/)
+
+## 题目描述
+输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。
+
+**示例 1：**
+```
+输入：head = [1,3,2]
+输出：[2,3,1]
+```
+
+**限制：**
+
+- `0 <= 链表长度 <= 10000`
+
+## 解法
+### Python3
+```python
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution:
+    def reversePrint(self, head: ListNode) -> List[int]:
+        res = []
+        while head:
+            res.append(head.val)
+            head = head.next
+        return res[::-1]
+```
+
+### Java
+```java
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public int[] reversePrint(ListNode head) {
+        Stack<Integer> s = new Stack<>();
+        while (head != null) {
+            s.push(head.val);
+            head = head.next;
+        }
+        int[] res = new int[s.size()];
+        int i = 0;
+        while (!s.isEmpty()) {
+            res[i++] = s.pop();
+        }
+        return res;
+    }
+}
+```
+
+### ...
+```
+
+```

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

@@ -0,0 +1,23 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public int[] reversePrint(ListNode head) {
+        Stack<Integer> s = new Stack<>();
+        while (head != null) {
+            s.push(head.val);
+            head = head.next;
+        }
+        int[] res = new int[s.size()];
+        int i = 0;
+        while (!s.isEmpty()) {
+            res[i++] = s.pop();
+        }
+        return res;
+    }
+}

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

@@ -0,0 +1,13 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution:
+    def reversePrint(self, head: ListNode) -> List[int]:
+        res = []
+        while head:
+            res.append(head.val)
+            head = head.next
+        return res[::-1]