Min: 5월 1주차 문제 풀이

05월/1주차/[LCD] Palindrome Number/Min.java

@@ -0,0 +1,11 @@
+class Min {
+    public boolean isPalindrome(int x) {
+        String s = Integer.toString(x);
+        String reverse = new StringBuilder(s).reverse().toString();
+
+        if(s.equals(reverse)) {
+            return true;
+        }
+        return false;
+    }
+}

05월/1주차/[LCD] Two Sum/Min.java

@@ -0,0 +1,16 @@
+class Min {
+    public int[] twoSum(int[] nums, int target) {
+        int[] answer = new int[2];
+        for(int i = 0; i < nums.length - 1; i++) {
+            for(int j = i + 1; j < nums.length; j++) {
+                if(nums[i] + nums[j] == target) {
+                    answer[0] = i;
+                    answer[1] = j;
+                    break;
+                }
+            }
+        }
+        return answer;
+
+    }
+}

05월/1주차/[PRGRMS] 야근 지수/Min.java

@@ -0,0 +1,23 @@
+import java.util.*;
+
+class Min {
+    public long solution(int n, int[] works) {
+        long answer = 0;
+        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());
+
+        for(int work : works) {
+            pq.offer(work);
+        }
+
+        for(int i = 0; i < n; i++) {
+            int work = pq.poll();
+            work = work - 1 >= 0 ? work - 1 : 0;
+            pq.offer(work);
+        }
+
+        while(!pq.isEmpty()) {
+            answer += Math.pow(pq.poll(), 2);
+        }
+        return answer;
+    }
+}