feat:구현

Author: Suxxxxhyun

Week3/개인/두원사이의_정수쌍/suhyun.py

@@ -8,10 +8,8 @@ def solution(r1, r2):
     for r in range(1, r2):
         if r < r1:
             answer += (getDotCnt(r, r2, "r2") - getDotCnt(r, r1, "r1"))
-            print(answer)
         else:
             answer += getDotCnt(r, r2, "r2")
-            print(answer)
 
     answer = answer * 4
     answer += (r2 - r1 + 1) * 4

Week3/공통/햄버거만들기/suhyun.py

@@ -21,6 +21,8 @@
 # 테스트 17 〉	통과 (0.00ms, 10.3MB)
 # 테스트 18 〉	통과 (0.01ms, 10.1MB)
 
+# 파이썬에서 문자열.pop(i)은 시간복잡도가 O(N)이다.
+
 def solution(ingredient):
     answer = 0
 

Week4/공통/나머지가_1이되는_수찾기/suhyun.py

@@ -0,0 +1,7 @@
+def solution(n):
+    
+    for k in range(2, n):
+        if n % k == 1:
+            return k
+
+print(solution(12))

Week4/공통/삼총사/suhyun.java

@@ -0,0 +1,20 @@
+package Week4.공통.삼총사;
+public class suhyun {
+    public int solution(int[] number) {
+        int answer = 0;
+
+        for(int i=0; i<number.length; i++){
+            int sum = 0;
+            for(int j=i+1; j<number.length; j++){
+                for(int k=j+1; k<number.length; k++){
+                    sum += number[i] + number[j] + number[k];
+                    if(sum == 0){
+                        answer += 1;
+                    }
+                    sum = 0;
+                }
+            }
+        }
+        return answer;
+    }
+}

Week4/공통/삼총사/suhyun.py

@@ -0,0 +1,16 @@
+def solution(number):
+    answer = 0
+    
+    sum = 0
+    for i in range(len(number)):
+        for j in range(i+1, len(number)):
+            for k in range(j+1, len(number)):
+                sum += number[i] + number[j] + number[k]
+                if sum == 0:
+                    answer += 1
+                sum = 0
+    
+    return answer
+
+number = [-2, 3, 0, 2, -5]
+print(solution(number))

Week4/공통/삼총사/test.java

@@ -0,0 +1,61 @@
+package Week4.공통.숫자짝꿍;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+
+//자바에서 숫자 3을 char형의 '3'으로 변환하려면,
+//int a = 3;
+//char b = (char)(a + '0')
+//b -> '3'이 대입된다.
+
+//자바에서 제네릭타입의 내림차순 정렬은 다음과 같다.
+//Collections.sort(배열, Collections.reverseOrder());
+
+//시간초과코드
+public class suhyun {
+    public String solution(String X, String Y) {
+        String answer = "";
+        List<Integer> a = new ArrayList<>();
+        boolean z = false;
+        for(int i=0; i<10; i++){
+            int cntX = 0, cntY = 0;
+            if(X.contains(String.valueOf(i)) && Y.contains(String.valueOf(i))) {
+                for(int j=0; j<X.length(); j++){
+                    if(X.charAt(j) == (char)(i + '0')){
+                        cntX += 1;
+                    }
+                }
+                for(int j=0; j<Y.length(); j++){
+                    if(Y.charAt(j) == (char)(i + '0')){
+                        cntY += 1;
+                    }
+                }
+                if(cntX >= 1 && cntY >= 1){
+                    z = true;
+                    for(int l=0; l<Math.min(cntX, cntY); l++){
+                        a.add(i);
+                    }
+                }
+            }
+
+        }
+
+        Collections.sort(a, Collections.reverseOrder());
+
+        for(int i=0; i<a.size(); i++){
+            answer += a.get(i);
+        }
+
+        if(!z){
+            answer += "-1";
+        }
+
+        if(answer.length() > 1 && answer.charAt(0) == '0'){
+            answer = "0";
+        }
+
+        return answer;
+    }
+}

Week4/공통/숫자짝꿍/suhyun.java

@@ -0,0 +1,33 @@
+def solution(X, Y):
+    answer = ''
+    ans = []
+    
+    z = False
+    for k in range(10):
+        if str(k) in X and str(k) in Y:
+            z = True
+            if Y.count(str(k)) > 1 or X.count(str(k)) > 1:
+                cnt = min(Y.count(str(k)), X.count(str(k)))
+                for _ in range(cnt):
+                    ans.append(str(k))
+            else:
+                ans.append(str(k))
+            # print(str(k))
+            # print(X.count(str(k)))
+            # print(Y.count(str(k)))
+            # print("=====")
+    
+    ans.sort(reverse=True)
+    if z == False:
+        answer = "-1"
+    
+    # print(ans)
+    for a in ans:
+        answer += a
+    
+    if len(answer) > 1 and answer[0] == "0":
+        answer = "0"
+    
+    return answer
+
+print(solution("1000", "100"))

Week4/공통/숫자짝꿍/suhyun.py

@@ -0,0 +1,35 @@
+package Week4.공통.숫자짝꿍;
+
+public class suhyun1 {
+    public String solution(String X, String Y) {
+        StringBuilder sb = new StringBuilder();
+        int[] x = {0,0,0,0,0,0,0,0,0,0};
+        int[] y = {0,0,0,0,0,0,0,0,0,0};
+
+        for(int i=0; i<X.length(); i++){
+            int z = X.charAt(i) - '0';
+            x[z] += 1;
+        }
+
+        for(int i=0; i<Y.length(); i++){
+            int z = Y.charAt(i) - '0';
+            y[z] += 1;
+        }
+
+        for(int i=9; i>-1; i--){
+            if(x[i] > 0 && y[i] > 0){
+                for(int j=0; j<Math.min(x[i], y[i]); j++){
+                    sb.append(String.valueOf(i));
+                }
+            }
+        }
+
+        if("".equals(sb.toString())){
+            return "-1";
+        } else if(sb.length() > 0 && sb.toString().charAt(0) == '0'){
+            return "0";
+        } else {
+            return sb.toString();
+        }
+    }
+}