Mun: 5월 1주차 문제 풀이

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

@@ -0,0 +1,17 @@
+class Mun {
+    public boolean isPalindrome(int x) {
+        if(x < 0) {
+            return false;
+        }
+        int origin = x;
+        int reverse = 0;
+        while(origin > 0) {
+            int end = origin%10;
+            reverse*=10;
+            reverse+=end;
+            origin/=10;
+        }
+
+        return x == reverse; 
+    }
+}

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

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

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

@@ -0,0 +1,25 @@
+import java.util.*;
+
+class Mun {
+    public long solution(int n, int[] works) {
+        PriorityQueue<Integer> que = new PriorityQueue<>((o1, o2) -> {
+            return o2 - o1;
+        });
+        for(int w : works) {
+            que.add(w);
+        }
+        while(n > 0 && que.size() > 0) {
+            int w = que.poll();
+            w--;
+            n--;
+            if(w > 0) {
+                que.add(w);
+            }
+        }
+        long answer = 0;
+        while(que.size() > 0) {
+            answer+=(long) Math.pow(que.poll(), 2);
+        }
+        return answer;
+    }
+}