feat : 프로그래머스 완전탐색

Author: cyeji

src/main/java/sgyj/programmers/yeji/cs/Solution42839.java

@@ -0,0 +1,50 @@
+package sgyj.programmers.yeji.cs;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class Solution42839 {
+    private static boolean[] visited;
+    private static Set<Integer> answer = new HashSet<>();
+
+    public static int solution(String numbers) {
+        String[] numberStr = numbers.split("");
+        int n = numberStr.length;
+        visited = new boolean[n];
+        for(int i=0; i<n; i++){
+            visited[i] = true;
+            checkPrime(numberStr,i,n,numberStr[i],0);
+        }
+        return answer.size();
+    }
+
+    public static void checkPrime(String[] numberStr, int i, int n,String target, int count){
+        if(i==n && count != n) i=0;
+        if(i==n || count == n) return;
+        if(!visited[i]){
+            target += numberStr[i];
+        }
+        if(isPrime(Integer.valueOf(target))){
+            answer.add(Integer.valueOf(target));
+        }
+        visited[i] = true;
+        checkPrime(numberStr,i+1,n,target,count+1);
+        visited[i] = false;
+    }
+
+    public static boolean isPrime(int target){
+        boolean isPrime = true;
+        if(target == 0 || target == 1) return false;
+        for(int p=2; p<target; p++){
+            if(target % p == 0) {
+                isPrime = false;
+            }
+        }
+        return isPrime;
+    }
+
+    public static void main ( String[] args ) {
+        String numbers = "17";
+        System.out.println(solution(numbers));
+    }
+}

src/main/java/sgyj/programmers/yeji/cs/Solution42842.java

@@ -0,0 +1,30 @@
+package sgyj.programmers.yeji.cs;
+
+public class Solution42842 {
+    public static int[] solution(int brown, int yellow) {
+        int[] answer = new int[2];
+        int karo = yellow;
+        int sero = 1;
+
+        while(sero <= karo){
+            int comapreBrown =  (karo * 2) + (2 * sero) + 4;
+            if(comapreBrown == brown){
+                answer[0] = karo+2;
+                answer[1] = sero+2;
+                return answer;
+            }
+            sero++;
+            karo = (yellow / sero) + (yellow % sero);
+        }
+
+        return answer;
+    }
+
+    public static void main ( String[] args ) {
+        int brown = 10;
+        int yellow = 2;
+        for(int s : solution(brown,yellow)){
+            System.out.print( s + " " );
+        }
+    }
+}

src/main/java/sgyj/programmers/yeji/cs/Solution87946.java

@@ -0,0 +1,34 @@
+package sgyj.programmers.yeji.cs;
+
+public class Solution87946 {
+    private static boolean[] check;
+    private static int answer = -1;
+
+    public static int solution(int k, int[][] dungeons) {
+        check = new boolean[dungeons.length];
+
+        dfs(k,dungeons,0);
+
+        return answer;
+    }
+
+    public static void dfs(int tired, int[][] dungeons, int cnt){
+        for(int i=0; i<dungeons.length; i++){
+            if(!check[i] && dungeons[i][0]<=tired){
+                check[i] = true;
+                dfs(tired-dungeons[i][1],dungeons,cnt+1);
+                check[i] = false;
+            }
+        }
+        answer = Math.max(answer,cnt);
+    }
+    public static void main ( String[] args ) {
+        int k = 80;
+        int[][] dungeons = {
+//            [[80,20],[50,40],[30,10]]
+            {80,20},{50,40},{30,10}
+        };
+
+        System.out.println( solution(k,dungeons) );
+    }
+}