[24.07.14/JAVA] LeetCode

Author: par3k

JAVA_LEETCODE_2024/.idea/.gitignore

@@ -0,0 +1,31 @@
+public class solution35 {
+    /**
+     * 35. Search Insert Position
+     *
+     * Given a sorted array of distinct integers and a target value,
+     * return the index if the target is found.
+     * If not, return the index where it would be if it were inserted in order.
+     * You must write an algorithm with O(log n) runtime complexity.
+     */
+    public static void main(String[] args) {
+        int[] nums = {1,3,5,6};
+        System.out.println(solution(5, nums));
+    }
+
+    public static int solution(int target, int[] nums) {
+        int left = 0;
+        int right = nums.length - 1;
+
+        while (left <= right) {
+            int mid = left + (right - left) / 2;
+            if (nums[mid] == target) {
+                return mid;
+            } else if (nums[mid] > target) {
+                right = mid - 1;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+}

JAVA_LEETCODE_2024/.idea/JAVA_LEETCODE_2024.iml

@@ -0,0 +1,30 @@
+import java.util.Scanner;
+
+public class solution70 {
+    /**
+     * 70. Climbing Stairs
+     *
+     * You are climbing a staircase. It takes n steps to reach the top.
+     * Each time you can either climb 1 or 2 steps.
+     * In how many distinct ways can you climb to the top?
+     */
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        System.out.println(climbStairs(n));
+    }
+
+    public static int climbStairs(int n) {
+        // dp로 처리
+        int[] answer = new int[n + 1];
+        answer[0] = 1;
+        answer[1] = 1;
+
+        for (int i = 2; i <= n; ++i) {
+            answer[i] = answer[i - 1] + answer[i - 2];
+        }
+
+        return answer[n];
+    }
+
+}