Merge pull request #1 from mhfikrianwr/easy

Solved problem 35 (Search insert position)

Author: mhfikrianwr

.gitignore

@@ -0,0 +1,4 @@
+test.c
+test.cpp
+test.py
+test.java

.vscode/settings.json

@@ -0,0 +1,30 @@
+{
+  "files.associations": {
+    "**/easy/*.cpp": "plaintext",
+    "**/easy/*.c": "plaintext",
+    "**/easy/*.py": "plaintext",
+    "**/easy/*.java": "plaintext",
+
+    "**/medium/*.cpp": "plaintext",
+    "**/medium/*.c": "plaintext",
+    "**/medium/*.py": "plaintext",
+    "**/medium/*.java": "plaintext",
+
+    "**/hard/*.cpp": "plaintext",
+    "**/hard/*.c": "plaintext",
+    "**/hard/*.py": "plaintext",
+    "**/hard/*.java": "plaintext"
+  },
+  "C_Cpp.errorSquiggles": "Disabled",
+  "C_Cpp.intelliSenseEngine": "Disabled",
+  "python.analysis.diagnosticMode": "off",
+  "java.errors.incompleteClasspath.severity": "ignore",
+  "editor.quickSuggestions": {
+    "other": false,
+    "comments": false,
+    "strings": false
+},
+"editor.suggestOnTriggerCharacters": false,
+"editor.parameterHints.enabled": false,
+"editor.inlineSuggest.enabled": false
+}

easy/.gitkeep

@@ -0,0 +1,15 @@
+int searchInsert(int* nums, int numsSize, int target) {
+    bool lowest = false;
+    int ans = 0;
+    for(int i = 0; i < numsSize; i++){
+        if(nums[i] == target){
+            return i;
+        }
+        if(nums[i] >= target && !lowest){
+            ans = i;
+            lowest = true;
+        }
+    }
+    if(!lowest) return numsSize;
+    return ans;
+}

easy/35_Search_Insert_Position.c

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int searchInsert(vector<int>& nums, int target) {
+        int l = 0, r =  nums.size() - 1;
+        bool ans = false;
+        while(l < r){
+            int mid = l + (r-l)/2;
+            if(nums[mid] == target){
+                return mid;
+            } else if(nums[mid] < target){
+                l = mid+1;
+            }else{
+                r = mid -1;
+            }
+        }
+        if(nums[l] < target) return l+1;
+        else return l;
+    }
+};

easy/35_Search_Insert_Position.cpp

@@ -0,0 +1,18 @@
+class Solution:
+    def searchInsert(self, nums: List[int], target: int) -> int:
+
+        l = len(nums)
+        ans = 0
+        lowest = False
+        for i in range(l):
+            if(nums[i] == target):
+                ans = i
+                return i
+            if(nums[i] >= target and not lowest):
+                lowest = True
+                ans = i
+
+        if(not lowest): return l
+        else: return ans
+            
+        

easy/35_Search_Insert_Position.py

@@ -0,0 +1,20 @@
+class Solution {
+    public int searchInsert(int[] nums, int target) {
+        HashSet<Integer> v = new HashSet<Integer>();
+        int b = 0;
+        boolean lowest = false;
+        boolean found = true;
+        for(int i = 0; i < nums.length; i++){
+            if(!v.contains(target) && nums[i] == target){
+                return i;
+            }
+            if(nums[i] >= target && !lowest){
+                b = i;
+                lowest = true;
+            }
+            v.add(nums[i]);
+        }
+        if(!lowest) return nums.length;
+        return b;
+    }
+}