solution for remove element

Author: edyluisrey

src/leetcode/RemoveDuplicatesfromSortedArray.java

@@ -17,7 +17,7 @@ public int removeDuplicates(int[] nums) {
         	}else{
         		nums[++index]=nums[i+1];
         	}
-        }  System.out.println(Arrays.toString(nums));
+        }  //System.out.println(Arrays.toString(nums));
         return nums.length-len;
     }
 

src/leetcode/RemoveElement.java

@@ -0,0 +1,24 @@
+package leetcode;
+
+import java.util.Arrays;
+
+public class RemoveElement {
+
+	public static void main(String[] args) {
+		RemoveElement test = new RemoveElement();
+		System.out.println(test.removeElement(new int[] {3,2,2,3,3,4}, 3));
+
+	}
+	
+	public int removeElement(int[] nums, int val) {
+        int len=0;
+        for(int i=0; i< nums.length; i++){
+        	if(nums[i]!=val){  
+        		nums[len]=nums[i];
+        		len++;
+        	}		
+        }  
+        return len;
+    }
+
+}

src/leetcode/SameTree.java

@@ -0,0 +1,30 @@
+package leetcode;
+
+public class SameTree {
+
+	public static void main(String[] args) {
+		SameTree test= new SameTree();
+		TreeNode t = new TreeNode(2);
+		t.left= new TreeNode(3);
+		t.right =  new TreeNode(4);
+		TreeNode t2 = new TreeNode(2);
+		t2.left= new TreeNode(3);
+		t2.right =  new TreeNode(4);
+		System.out.println(test.isSameTree(t, t2));
+
+	}
+	
+	public boolean isSameTree(TreeNode p, TreeNode q) {
+        
+    }
+
+}
+
+class TreeNode {
+	   int val;
+	   TreeNode left;
+	   TreeNode right;
+	   TreeNode(int x) { 
+		   val = x; 
+	    }
+}