feat: 면회전 알고리즘 학습 완료

Author: skyleedevzero86

src/com/algorithm2025/backjoon3/day004/Example20250626_Q_L_594.java

@@ -0,0 +1,29 @@
+package com.algorithm2025.backjoon3.day004;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class Example20250626_Q_L_594 { //번외 letcode 594 Longest Harmonious Subsequence
+
+    public int findLHS(int[] nums) {
+
+        Map<Integer, Integer> map = new HashMap<>();
+        int logset=0;
+
+        for(int i=0;i<nums.length;i++){
+            if(map.containsKey(nums[i])){
+                map.put(nums[i],map.get(nums[i])+1);
+            } else {
+                map.put(nums[i],1);
+            }
+        }
+
+        for(int key:map.keySet()){
+            if(map.containsKey(key+1)){
+                logset = Math.max(logset,map.get(key)+map.get(key+1));
+            }
+        }
+
+        return logset;
+    }
+}

src/com/algorithm2025/backjoon3/day004/Example20250626_Q_L_704.java

@@ -0,0 +1,25 @@
+package com.algorithm2025.backjoon3.day004;
+
+import java.util.Scanner;
+
+public class Example20250626_Q_L_704 { //번외 letcode 704 Binary Search
+    public int search(int[] arr,int target){
+
+    int low = 0;
+    int height = arr.length-1;
+    while(low<height){
+        int mid = (low+height)/2;
+        if(arr[mid]==target){
+            return mid;
+        } else if(arr[mid]<target){
+            low = mid+1;
+        } else {
+            height = mid-1;
+        }
+    }
+
+    return -1;
+
+    }
+
+}

src/com/algorithm2025/backjoon3/day004/Example20250626_Q_L_744.java

@@ -0,0 +1,14 @@
+package com.algorithm2025.backjoon3.day004;
+
+public class Example20250626_Q_L_744 { //번외 letcode 744 Find Smallest Letter Greater Than Target
+   public char nextGreatestLetter(char[] letters, char target) {
+
+       for(char c:letters){
+           if(c>target){
+                return c;
+           }
+       }
+       return letters[0];
+   }
+
+}