add 1099

fishercoder1534 · fishercoder1534 · commit f3d09d7515f6 · 2019-11-29T07:23:43.000-08:00
diff --git a/README.md b/README.md
@@ -43,6 +43,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | O(n) | O(n) | |Easy||
 |1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | | | |Easy||
 |1119|[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) | | | [:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw)|Easy||
+|1099|[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) | |  | |Easy||
 |1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | O(n^2) | O(1) | |Easy||
 |1086|[High Five](https://leetcode.com/problems/high-five/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1086.java) | | | |Easy||
 |1085|[Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1085.java) | | | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1099.java b/src/main/java/com/fishercoder/solutions/_1099.java
@@ -0,0 +1,41 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1099. Two Sum Less Than K
+ *
+ * Given an array A of integers and integer K,
+ * return the maximum S such that there exists i < j with A[i] + A[j] = S and S < K.
+ * If no i, j exist satisfying this equation, return -1.
+ *
+ * Example 1:
+ * Input: A = [34,23,1,24,75,33,54,8], K = 60
+ * Output: 58
+ * Explanation:
+ * We can use 34 and 24 to sum 58 which is less than 60.
+ *
+ * Example 2:
+ * Input: A = [10,20,30], K = 15
+ * Output: -1
+ * Explanation:
+ * In this case it's not possible to get a pair sum less that 15.
+ *
+ * Note:
+ * 1 <= A.length <= 100
+ * 1 <= A[i] <= 1000
+ * 1 <= K <= 2000
+ * */
+public class _1099 {
+    public static class Solution1 {
+        public int twoSumLessThanK(int[] A, int K) {
+            int maxSum = Integer.MIN_VALUE;
+            for (int i = 0; i < A.length - 1; i++) {
+                for (int j = i + 1; j < A.length; j++) {
+                    if (A[i] + A[j] < K) {
+                        maxSum = Math.max(maxSum, A[i] + A[j]);
+                    }
+                }
+            }
+            return maxSum == Integer.MIN_VALUE ? -1 : maxSum;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1099Test.java b/src/test/java/com/fishercoder/_1099Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1099;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1099Test {
+    private static _1099.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1099.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(58, solution1.twoSumLessThanK(new int[]{34, 23, 1, 24, 75, 33, 54, 8}, 60));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(-1, solution1.twoSumLessThanK(new int[]{10, 20, 30}, 15));
+    }
+
+}
