include solution for leetcode 200 and 26

Author: tonardo2015

java/200_number_of_island.java

@@ -0,0 +1,33 @@
+class Solution {
+    public int numIslands(char[][] grid){
+
+     if(grid == null || grid.length == 0){
+        return 0;
+     }
+
+     int rows = grid.length;
+     int cols = grid[0].length;
+     int islandCounter = 0;
+     for(int r = 0; r < rows; r++){
+        for(int c = 0; c < cols; c++){
+            if(grid[r][c] == '1' ){
+                islandCounter += 1;
+                dfs(grid, r, c);
+            }
+        }
+     }
+     return islandCounter;
+    }
+
+    private void dfs(char[][] grid, int r, int c){
+        if(r < 0 || r >= grid.length || c < 0 || c >= grid[0].length || grid[r][c] == '0'){
+           return;
+        }
+
+        grid[r][c] = '0';
+        dfs(grid, r+1, c);
+        dfs(grid, r-1, c);
+        dfs(grid, r, c+1);
+        dfs(grid, r, c-1);
+    }
+}

java/26_remove_duplicates_from_sorted_array.java

@@ -0,0 +1,21 @@
+public class Solution{
+    public int removeDuplicates(int[] nums){
+        if(nums.length == 0){
+            return 0;
+        }
+        int uniqNum = 1;
+        for(int i = 1; i < nums.length; i++){
+            if(nums[i] != nums[i-1]){
+                nums[uniqNum] = nums[i];
+                uniqNum++;
+            }
+        }
+        return uniqNum;
+    }
+
+    public static void main(String[] args){
+        int[] nums = {0, 0, 1, 1, 1, 2, 2, 3, 3, 4};
+        Solution sol = new Solution();
+        System.out.println(sol.removeDuplicates(nums));
+    }
+}