feat: azl397985856#19 add java implementation (azl397985856#257)

* correct typos

* Add translations

* 新增HTTP/1.0, HTTP/1.1， HTTP/2的对比

* 增加HTTP/1.1和HTTP/2的性能对比的Demo

* 翻译大部分基础数据结构，但是REACT部分没有翻译

* update description of `HTTP/1.0`

* add WIP tag, update some translation details

* change 'fundamental' to 'basic'

* remove some trivial details about HTTP/1.0

* error correction

* translation for DP

* translation for string problems

* error correction

* correct wrongly typed

* translation for binary-tree-traversal.md

* correct wrongly typed

* update README.en.md

* update description  of Huffman encoding

* update file path of Binary-tree-traversal-en.md.

* correct wrongly typed

* update paths of thinkings

* translation for basic-algorithm.md (Draft)

* translation for bloom-filter.md

* add java solution with inorder traversing

* Update 230.kth-smallest-element-in-a-bst.md

* add java implementations.

* add java implementations

* Update 94.binary-tree-inorder-traversal.md

* Update 98.validate-binary-search-tree.md

* add java implementation to 19

* fix conflict

* fix typo

Co-authored-by: lucifer <[email protected]>

Author: StoneLyu

Diff for: problems/19.removeNthNodeFromEndofList.md

@@ -49,6 +49,9 @@ Could you do this in one pass?
 
 ## 代码
 
+Support: JS, Java
+
+- Javascript Implementation
 
 ```js
 /*
@@ -128,4 +131,38 @@ var removeNthFromEnd = function(head, n) {
   return dummyHead.next;
 };
 
+```
+
+- Java Code
+
+```java
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode removeNthFromEnd(ListNode head, int n) {
+        TreeNode dummy = new TreeNode(0);
+        dummy.next = head;
+        TreeNode first = dummy;
+        TreeNode second = dummy;
+
+        if (int i=0; i<=n; i++) {
+            first = first.next;
+        }
+
+        while (first != null) {
+            first = first.next;
+            second = second.next;
+        }
+
+        second.next = second.next.next;
+
+        return dummy.next;
+    }
+}
 ```

Diff for: problems/53.maximum-sum-subarray-cn.md

@@ -80,7 +80,7 @@ If you have figured out the O(n) solution, try coding another solution using the
 
 #### 复杂度分析
 - *时间复杂度：* `O(nlogn) - n 是数组长度`
-- *空间复杂度：* `O(logn)` - 因为调用栈的深度最多是logn。
+- *空间复杂度：* `Ologn)` - 因为调用栈的深度最多是logn。
 
 #### 解法五 - [动态规划](https://www.wikiwand.com/zh-hans/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92)
 动态规划的难点在于找到状态转移方程，

Diff for: problems/98.validate-binary-search-tree.md

@@ -314,4 +314,3 @@ class Solution {
 ## 相关题目
 
 [230.kth-smallest-element-in-a-bst](./230.kth-smallest-element-in-a-bst.md)
-