Merge pull request #51 from Samridhi-98/master

Java solution of the leetcode problem number 35

Author: larissalages

leetcode/Java/search_insert_position.java

@@ -0,0 +1,24 @@
+#Java Solution
+
+class Solution {
+public int searchInsert(int[] nums, int target) {
+
+    int size = nums.length;
+    //If element is present in the array
+    for(int i=0;i<size;i++){
+        if(nums[i] == target)
+            return i;
+    }
+    int j=0;
+    //If element is not there in the array
+    for(int i=0;i<size;i++){
+        if(nums[i] < target){
+             j++;
+        }else{
+            break;
+        }    
+    }
+    return j;
+    
+}
+}

leetcode/search_insert_position

@@ -0,0 +1,24 @@
+#Java Solution
+
+class Solution {
+public int searchInsert(int[] nums, int target) {
+
+    int size = nums.length;
+    //If element is present in the array
+    for(int i=0;i<size;i++){
+        if(nums[i] == target)
+            return i;
+    }
+    int j=0;
+    //If element is not there in the array
+    for(int i=0;i<size;i++){
+        if(nums[i] < target){
+             j++;
+        }else{
+            break;
+        }    
+    }
+    return j;
+    
+}
+}