Merge pull request #29 from algorithm-cote-study/Yeji/programmers

Yeji/programmers

Author: seunggulee1007

src/main/java/sgyj/programmers/ReadMe.md

@@ -0,0 +1,35 @@
+## Programmers
+
+
+## Programmers 고득점 Kit
+
+### Section1 - 해시
+
+- [폰켓몬](https://school.programmers.co.kr/learn/courses/30/lessons/1845)
+- [완주하지 못한 선수](https://school.programmers.co.kr/learn/courses/30/lessons/42576)
+- [전화번호 목록](https://school.programmers.co.kr/learn/courses/30/lessons/42577)
+- [위장](https://school.programmers.co.kr/learn/courses/30/lessons/42578)
+- [베스트앨범](https://school.programmers.co.kr/learn/courses/30/lessons/42579)
+
+### Section2 - 스택/큐
+
+- [같은 숫자는 싫어](https://school.programmers.co.kr/learn/courses/30/lessons/12906)
+- [기능개발](https://school.programmers.co.kr/learn/courses/30/lessons/42586)
+- [올바른 괄호](https://school.programmers.co.kr/learn/courses/30/lessons/12909)
+- [프린터](https://school.programmers.co.kr/learn/courses/30/lessons/42587)
+- [다리를 지나는 트럭](https://school.programmers.co.kr/learn/courses/30/lessons/42583)
+- [주식가격](https://school.programmers.co.kr/learn/courses/30/lessons/42584)
+
+### Section3 - 힙(HEAP)
+
+- [더 맵게](https://school.programmers.co.kr/learn/courses/30/lessons/42626)
+
+### Section4 - 정렬(Sort)
+
+### Section5 - 완전탐색
+
+### Section6 - 탐욕법(Greedy)
+
+### Section7 - 동적 계획법(Dynamic Programming)
+
+### 

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

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.hash;
+package sgyj.programmers.yeji.section1;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/sgyj/programmers/yeji/hash/Solution1845.java renamed to src/main/java/sgyj/programmers/yeji/section1/Solution1845.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.hash;
+package sgyj.programmers.yeji.section1;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/sgyj/programmers/yeji/hash/Solution42576.java renamed to src/main/java/sgyj/programmers/yeji/section1/Solution42576.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.hash;
+package sgyj.programmers.yeji.section1;
 
 import java.util.ArrayDeque;
 import java.util.Arrays;

src/main/java/sgyj/programmers/yeji/hash/Solution42577.java renamed to src/main/java/sgyj/programmers/yeji/section1/Solution42577.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.hash;
+package sgyj.programmers.yeji.section1;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/sgyj/programmers/yeji/hash/Solution42578.java renamed to src/main/java/sgyj/programmers/yeji/section1/Solution42578.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.hash;
+package sgyj.programmers.yeji.section1;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/sgyj/programmers/yeji/hash/Solution42579.java renamed to src/main/java/sgyj/programmers/yeji/section1/Solution42579.java

@@ -1,8 +1,6 @@
-package sgyj.programmers.yeji.stack;
+package sgyj.programmers.yeji.section2;
 
-import java.lang.reflect.Array;
 import java.util.ArrayDeque;
-import java.util.Arrays;
 import java.util.Deque;
 
 // 같은 숫자는 싫어

src/main/java/sgyj/programmers/yeji/stack/Solution12906.java renamed to src/main/java/sgyj/programmers/yeji/section2/Solution12906.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.stack;
+package sgyj.programmers.yeji.section2;
 
 import java.util.ArrayDeque;
 import java.util.Deque;

src/main/java/sgyj/programmers/yeji/stack/Solution12909.java renamed to src/main/java/sgyj/programmers/yeji/section2/Solution12909.java

@@ -0,0 +1,68 @@
+package sgyj.programmers.yeji.section2;
+
+import java.util.ArrayDeque;
+import java.util.Deque;
+
+// 다리를 지나는 트럭
+public class Solution42583 {
+
+    private static int solution(int bridge_length, int weight, int[] truck_weights){
+        int answer = 0;
+
+        Deque<Integer> q = new ArrayDeque<>();
+        int sum = 0; // 다리를 건너는 트럭들의 무게 합
+
+        for(int t : truck_weights) {
+
+            while(true) {
+                //큐가 비어있다면 다음 트럭 삽입
+                if(q.isEmpty()) {
+                    q.offer(t);
+                    sum += t;
+                    answer++;
+                    break;
+                }
+                //큐의 사이즈와 다리의 길이가 같다면 큐에서 큐에서 처음 값을 빼고 최대 무게 -
+                else if(q.size() == bridge_length) {
+                    sum -= q.poll();
+                }
+                //큐가 비어있지 않을 때
+                else {
+                    //다음 트럭이 최대 무게 초과
+                    if(sum + t > weight) {
+                        q.offer(0);
+                        answer++;
+                    }
+                    //다음 트럭이 최대 무게 이내
+                    else {
+                        q.offer(t);
+                        sum += t;
+                        answer++;
+                        break;
+                    }
+                }
+            }
+        }
+
+        //걸린 시간 + 마지막 트럭의 통과시간(다리의 길이)
+        return answer + bridge_length;
+    }
+
+
+    public static void main ( String[] args ) {
+        int bridge_length = 2;
+        int weight = 10;
+        int[] truck_weights = {7,4,5,6};
+        System.out.println(solution(bridge_length,weight,truck_weights));
+    }
+}
+
+class Truck{
+    int weight;
+    int distance;
+
+    Truck(int weight, int distance){
+        this.weight = weight;
+        this.distance = distance;
+    }
+}

src/main/java/sgyj/programmers/yeji/section2/Solution42583.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.stack;
+package sgyj.programmers.yeji.section2;
 
 import java.util.ArrayDeque;
 import java.util.Deque;

src/main/java/sgyj/programmers/yeji/stack/Solution42584.java renamed to src/main/java/sgyj/programmers/yeji/section2/Solution42584.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.stack;
+package sgyj.programmers.yeji.section2;
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;

src/main/java/sgyj/programmers/yeji/stack/Solution42586.java renamed to src/main/java/sgyj/programmers/yeji/section2/Solution42586.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.stack;
+package sgyj.programmers.yeji.section2;
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;

src/main/java/sgyj/programmers/yeji/stack/Solution42587.java renamed to src/main/java/sgyj/programmers/yeji/section2/Solution42587.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.heap;
+package sgyj.programmers.yeji.section3;
 
 import java.util.PriorityQueue;
 

src/main/java/sgyj/programmers/yeji/heap/Solution42626.java renamed to src/main/java/sgyj/programmers/yeji/section3/Solution42626.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.sort;
+package sgyj.programmers.yeji.section4;
 
 import java.util.Arrays;
 import java.util.stream.Collectors;

src/main/java/sgyj/programmers/yeji/sort/Solution42746.java renamed to src/main/java/sgyj/programmers/yeji/section4/Solution42746.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.sort;
+package sgyj.programmers.yeji.section4;
 
 import java.util.Arrays;
 

src/main/java/sgyj/programmers/yeji/sort/Solution42747.java renamed to src/main/java/sgyj/programmers/yeji/section4/Solution42747.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.sort;
+package sgyj.programmers.yeji.section4;
 
 import java.util.Arrays;
 

src/main/java/sgyj/programmers/yeji/sort/Solution42748.java renamed to src/main/java/sgyj/programmers/yeji/section4/Solution42748.java

@@ -0,0 +1,22 @@
+package sgyj.programmers.yeji.section5;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class Solution42839 {
+
+    private static Set<Integer> primeSet = new HashSet<>();
+    private static boolean[] visited;
+    private static Character[] cm;
+    private static int answer = 0;
+    public static int solution(String numbers) {
+
+
+        return answer;
+    }
+
+    public static void main ( String[] args ) {
+        String numbers = "17";
+        System.out.println(solution(numbers));
+    }
+}

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

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.cs;
+package sgyj.programmers.yeji.section5;
 
 public class Solution42842 {
     public static int[] solution(int brown, int yellow) {

src/main/java/sgyj/programmers/yeji/cs/Solution42842.java renamed to src/main/java/sgyj/programmers/yeji/section5/Solution42842.java

@@ -1,4 +1,4 @@
-package sgyj.programmers.yeji.cs;
+package sgyj.programmers.yeji.section5;
 
 public class Solution87946 {
     private static boolean[] check;

src/main/java/sgyj/programmers/yeji/cs/Solution87946.java renamed to src/main/java/sgyj/programmers/yeji/section5/Solution87946.java

@@ -0,0 +1,36 @@
+package sgyj.programmers.yeji.section6;
+
+// 조이스틱
+public class Solution42860 {
+    private static int answer;
+    private static int min = Integer.MAX_VALUE;
+    private static int[] visited;
+    // A - 65, Z - 90
+    public static int solution(String name) {
+        visited = new int[name.length()];
+        int startAlpha = name.charAt( 0 );
+
+        if(startAlpha<=77){
+            visited[0] = startAlpha+1;
+            answer+= startAlpha+1;
+        }else{
+            visited[0] = 90-startAlpha;
+            answer+= 90-startAlpha;
+        }
+        for(int i=1; i<name.length(); i++){
+            moveJoyStick(1,visited[i-1], name,0);
+        }
+        return answer;
+    }
+
+    public static void moveJoyStick(int i, int cur, String name, int count){
+        int result = Integer.valueOf(name.charAt( i ));
+        int abs = Math.abs( 90 - cur );
+
+
+    }
+    public static void main ( String[] args ) {
+        String name = "JEROEN";
+        System.out.println(solution(name));
+    }
+}

src/main/java/sgyj/programmers/yeji/section6/Solution42860.java

@@ -0,0 +1,52 @@
+package sgyj.programmers.yeji.section7;
+
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+// N으로 표현
+public class Solution42895 {
+    public static int solution(int N, int number) {
+        List<Set<Integer>> countList = new ArrayList<>();
+
+        for(int i=0; i<9; i++)
+            countList.add(new HashSet<>());
+
+        countList.get(1).add(N); // N을 1개 쓴 값은 N 혼자이다.
+
+        for(int i=2; i<9; i++){
+            Set<Integer> countSet = countList.get(i);
+
+            for(int j=1; j<=i; j++){
+                Set<Integer> preSet = countList.get(j);
+                Set<Integer> postSet = countList.get(i - j);
+
+                for(int preNum : preSet){
+                    for(int postNum : postSet){
+                        countSet.add(preNum + postNum);
+                        countSet.add(preNum - postNum);
+                        countSet.add(preNum * postNum);
+
+                        if(preNum != 0 && postNum != 0)
+                            countSet.add(preNum / postNum);
+                    }
+                }
+            }
+
+            countSet.add(Integer.parseInt(String.valueOf(N).repeat(i)));
+        }
+
+        for(Set<Integer> sub : countList){
+            if(sub.contains(number))
+                return countList.indexOf(sub);
+        }
+
+        return -1;
+    }
+    public static void main ( String[] args ) {
+        int N = 2;
+        int number = 11;
+        System.out.println( solution(N,number) );
+    }
+}