Merge branch 'master' of https://github.com/BNSC1/leetcode-kotlin

Author: BNSC1

LeetCode/746. Min Cost Climbing Stairs.kt

@@ -0,0 +1,14 @@
+class Solution {
+    fun minCostClimbingStairs(cost: IntArray): Int {
+        var c1 = cost[0]
+        var c2 = cost[1]
+        for (i in 2 until cost.size) {
+          val cost = cost[i]
+          c1 = min(c1, c2) + cost
+          val tmp = c1
+          c1 = c2
+          c2 = tmp
+        }
+        return min(c1, c2)
+    }
+}

Pramp/Pairs with Specific Difference.java

@@ -0,0 +1,27 @@
+import java.io.*;
+import java.util.*;
+
+class Solution {
+
+  static int[][] findPairsWithGivenDifference(int[] arr, int k) {
+    HashSet<Integer> set = new HashSet<>();
+    ArrayList<int[]> res = new ArrayList<>();
+    
+    for (int i = 0; i < arr.length; i++) {
+      set.add(arr[i]);
+    }
+    for (int i = 0; i < arr.length; i++) {
+      int y = arr[i];
+      int x = k + y;
+      if (set.contains(x)) {
+        res.add(new int[] {x, y});
+      }
+      //x - y = k
+      //x = k + y
+    }
+    return res.toArray(new int[0][0]);
+  }
+
+  public static void main(String[] args) {}
+
+}