[최원준] Day12

leetcode2/2medium/최원준/Q1390.java

@@ -0,0 +1,41 @@
+package Leetcode.최원준;
+
+/*
+1. 아이디어 :
+
+
+2. 시간복잡도 :
+O( )
+
+3. 자료구조/알고리즘 :
+
+ */
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class Q1390 {
+    class Solution {
+        Map<Integer, Integer> cache = new HashMap<>();
+        public int divisors(int num) {
+            if (Math.sqrt(num) == (int)Math.sqrt(num)) return 0;
+            int count = 0, total = 0;
+            for (int i=1; i<Math.sqrt(num); i++) {
+                if (num % i == 0) {
+                    count+=2;
+                    total += i + num/i;
+                }
+                if (count>4) return 0;
+            }
+            if (count==4) cache.put(num, total);
+            return count==4? total : 0;
+        }
+        public int sumFourDivisors(int[] nums) {
+            int ans = 0;
+            for (int num : nums) {
+                ans += cache.containsKey(num)? cache.get(num) : divisors(num);
+            }
+            return ans;
+        }
+    }
+}

leetcode2/2medium/최원준/Q2981.java

@@ -0,0 +1,53 @@
+package Leetcode.최원준;
+
+/*
+1. 아이디어 :
+
+
+2. 시간복잡도 :
+O( )
+
+3. 자료구조/알고리즘 :
+
+ */
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class Q2981 {
+    class Solution {
+        public boolean check(String s) {
+            int n = s.length();
+            if (n==1) return true;
+            for (int i=1; i<n; i++) {
+                if (s.charAt(i-1) != s.charAt(i)) return false;
+            }
+            return true;
+        }
+        public int maximumLength(String s) {
+            Map<String, Integer> counter = new HashMap<>();
+            int n = s.length();
+            for (int i=0; i<n; i++) {
+                StringBuilder sb = new StringBuilder();
+                for (int j=i; j<n; j++) {
+                    sb.append(s.charAt(j));
+                    String sub = sb.toString();
+                    if (check(sub)) {
+                        counter.put(sub, counter.getOrDefault(sub, 0)+1);
+                    } else {
+                        break;
+                    }
+
+                }
+            }
+
+            int ans = -1;
+            for (var entry : counter.entrySet()) {
+                if (entry.getValue() >= 3) {
+                    ans = Math.max(ans, entry.getKey().length());
+                }
+            }
+            return ans;
+        }
+    }
+}

leetcode2/2medium/최원준/Q794.java

@@ -0,0 +1,63 @@
+package Leetcode.최원준;
+
+/*
+1. 아이디어 :
+
+
+2. 시간복잡도 :
+O( )
+
+3. 자료구조/알고리즘 :
+
+ */
+
+public class Q794 {
+    class Solution {
+        public boolean validTicTacToe(String[] board) {
+            for (var a : board) System.out.println(a);
+            int[] bingo = new int[2];
+            for (int i=0; i<3; i++) {
+                // 가로
+                if (board[i].charAt(0) != ' '
+                        && board[i].charAt(0) == board[i].charAt(1)
+                        && board[i].charAt(1) == board[i].charAt(2)) {
+                    bingo[board[i].charAt(0) == 'X'? 0:1] ++;
+                    if (bingo[0] == 1 && bingo[1] == 1) return false;
+                }
+                // 세로
+                if (board[0].charAt(i) != ' '
+                        && board[0].charAt(i) == board[1].charAt(i)
+                        && board[1].charAt(i) == board[2].charAt(i)) {
+                    bingo[board[0].charAt(i) == 'X'? 0:1] ++;
+                    if (bingo[0] == 1 && bingo[1] == 1) return false;
+                }
+            }
+
+            if (board[0].charAt(0) != ' '
+                    && board[0].charAt(0) == board[1].charAt(1)
+                    && board[1].charAt(1) == board[2].charAt(2)) {
+                bingo[board[0].charAt(0) == 'X'? 0:1]++;
+                if (bingo[0] == 1 && bingo[1] == 1) return false;
+            }
+            if (board[0].charAt(2) != ' '
+                    && board[0].charAt(2) == board[1].charAt(1)
+                    && board[1].charAt(1) == board[2].charAt(0)) {
+                bingo[board[0].charAt(2) == 'X'? 0:1]++;
+                if (bingo[0] == 1 && bingo[1] == 1) return false;
+            }
+
+            int[] counter = new int[2]; // x, o
+            for (int row=0; row<3; row++) for (int col=0; col<3; col++) {
+                if (board[row].charAt(col) == 'X') {
+                    counter[0]++;
+                } else if (board[row].charAt(col) == 'O') {
+                    counter[1]++;
+                }
+            }
+
+            if (bingo[0] == 1) return counter[0] == counter[1]+1;
+            if (bingo[1] == 1) return counter[0] == counter[1];
+            return counter[0] == counter[1] || counter[0] == counter[1]+1;
+        }
+    }
+}