Merge pull request #179

20.04 new problem in progress

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -1,6 +1,7 @@
 package com.github.contest
 
 
+import com.github.contest.binarySearch.twoSum
 import com.github.contest.hashTable.countGoodAlternativeSolution
 import com.github.contest.math.numberOfPowerfulInt
 import com.github.contest.strings.fullJustify
@@ -14,10 +15,15 @@ import java.util.TreeMap
 
 fun main() {
 
-    countGoodAlternativeSolution(intArrayOf(3, 1, 4, 3, 2, 2, 4), 2).also { println(it) }
+    twoSum(intArrayOf(-1, 0), -1).printArray()
+
 
 }
 
+fun countGoodData() {
+    countGoodAlternativeSolution(intArrayOf(3, 1, 4, 3, 2, 2, 4), 2).also { println(it) }
+}
+
 fun fullJustifyData() {
     fullJustify(
         arrayOf(

contest/src/main/java/com/github/contest/binarySearch/BinarySearchLeetcode.kt

@@ -37,3 +37,33 @@ fun minCapability(nums: IntArray, k: Int): Int {
 
     return ans
 }
+
+/**
+ *
+ */
+
+fun twoSum(numbers: IntArray, target: Int): IntArray {
+    var boundIndex = numbers.size - 1
+    var nullIndex = 0
+    for (i in numbers.indices) {
+        if (numbers[i] > target) {
+            boundIndex = i - 1
+        }
+        if (numbers[i] == 0) nullIndex = i
+    }
+
+    for (i in boundIndex downTo 0) {
+        var left = 0
+        var right = i
+        val tar = target - numbers[i]
+        if (tar == 0) return intArrayOf(i + 1, nullIndex + 1)
+        while (left <= right) {
+            var mid = (left + right) / 2
+            if (numbers[mid] == tar) return intArrayOf(mid + 1, i + 1)
+            if (numbers[mid] < tar) mid = left + 1
+            else right = mid - 1
+        }
+    }
+
+    return intArrayOf()
+}