add solution for leetcode 26

Author: Zhanganjin0520

README.md

@@ -386,7 +386,7 @@ LeetCode
 |29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| |Medium|
 |28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| |Easy|
 |27|[Remove Element](https://leetcode.com/problems/remove-element/)| [js](./algorithms/removeElement/removeElement.js) [python](./algorithms/removeElement/removeElement.python) |Easy|
-|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| |Easy|
+|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|  [java](./algorithms/Remove Duplicates From Sorted Array/Soultion.java)  |Easy|
 |25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| |Hard|
 |24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| |Medium|
 |23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| |Hard|

algorithms/Remove Duplicates From Sorted Array/Solution.java

@@ -0,0 +1,12 @@
+public class Solution {
+    public int removeDuplicates(int[] nums) {
+        int j = 0;
+        for(int i = 1; i<nums.length; i++){
+            if(nums[j]!=nums[i]){
+                j++;
+                nums[j] = nums[i];
+            }
+        }
+        return j+1;
+    }
+}

algorithms/twoSum/twoSum.java

@@ -1,10 +1,15 @@
-public int[] twoSum(int[] nums, int target) {
-    Map<Integer, Integer> numsIndexMap = new HashMap();
-    for (int i = 0; i < nums.length; i++) {
-        if (numsIndexMap.containsKey(target - nums[i])) {
-            return new int[]{numsIndexMap.get(target - nums[i]), i};
+import java.util.Map;
+
+public class TwoSum {
+    public int[] twoSum(int[] nums, int target) {
+        Map<Integer, Integer> numsIndexMap = new HashMap();
+        for (int i = 0; i < nums.length; i++) {
+            if (numsIndexMap.containsKey(target - nums[i])) {
+                return new int[]{numsIndexMap.get(target - nums[i]), i};
+            }
+            numsIndexMap.put(nums[i], i);
         }
-        numsIndexMap.put(nums[i], i);
+        throw new IllegalArgumentException();
     }
-    throw new IllegalArgumentException();
 }
+