[s0ooo0k] WEEK 10 Solutions

invert-binary-tree/s0ooo0k.java

@@ -0,0 +1,14 @@
+class Solution {
+    public TreeNode invertTree(TreeNode root) {
+        if(root==null) return null;
+
+        TreeNode left = invertTree(root.left);
+        TreeNode right = invertTree(root.right);
+
+        root.left=right;
+        root.right=left;
+
+        return root;
+    }
+}
+

jump-game/s0ooo0k.java

@@ -0,0 +1,15 @@
+class Solution {
+    public boolean canJump(int[] nums) {
+        int n = nums.length;
+        int maxJump=0;
+        for(int i=0; i<n; i++) {
+            if(i>maxJump) return false;
+            else {
+                maxJump = Math.max(maxJump, i+nums[i]);
+            }
+
+        }
+        return true;
+    }
+}
+