LeetCode 199

Author: LjyYano

solution/0100-0199/0199.Binary Tree Right Side View/README.md

@@ -38,12 +38,30 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public List<Integer> rightSideView(TreeNode root) {
+        List<Integer> ans = new ArrayList<>();
+        robot(root, ans, 0);
+        return ans;
+    }
+
+    private void robot(TreeNode root, List<Integer> ans, int level) {
+        if (root == null) {
+            return;
+        }
+        if (ans.size() <= level) {
+            ans.add(root.val);
+        }
+        ans.set(level, root.val);
+        robot(root.left, ans, level + 1);
+        robot(root.right, ans, level + 1);
+    }
+}
 ```
 
 ### **...**
 ```
 
 ```
 
-<!-- tabs:end -->
+<!-- tabs:end -->

solution/0100-0199/0199.Binary Tree Right Side View/README_EN.md

@@ -48,12 +48,30 @@
 ### **Java**
 
 ```java
-
+class Solution {
+    public List<Integer> rightSideView(TreeNode root) {
+        List<Integer> ans = new ArrayList<>();
+        robot(root, ans, 0);
+        return ans;
+    }
+
+    private void robot(TreeNode root, List<Integer> ans, int level) {
+        if (root == null) {
+            return;
+        }
+        if (ans.size() <= level) {
+            ans.add(root.val);
+        }
+        ans.set(level, root.val);
+        robot(root.left, ans, level + 1);
+        robot(root.right, ans, level + 1);
+    }
+}
 ```
 
 ### **...**
 ```
 
 ```
 
-<!-- tabs:end -->
+<!-- tabs:end -->

solution/0100-0199/0199.Binary Tree Right Side View/Solution.java

@@ -0,0 +1,19 @@
+class Solution {
+    public List<Integer> rightSideView(TreeNode root) {
+        List<Integer> ans = new ArrayList<>();
+        robot(root, ans, 0);
+        return ans;
+    }
+
+    private void robot(TreeNode root, List<Integer> ans, int level) {
+        if (root == null) {
+            return;
+        }
+        if (ans.size() <= level) {
+            ans.add(root.val);
+        }
+        ans.set(level, root.val);
+        robot(root.left, ans, level + 1);
+        robot(root.right, ans, level + 1);
+    }
+}