나의 공부 기록

⭐ 나의 풀이 #!/bin/python3 import math import os import random import re import sys from array import array # # Complete the 'arrayManipulation' function below. # # The function is expected to return a LONG_INTEGER. # The function accepts following parameters: # 1. INTEGER n # 2. 2D_INTEGER_ARRAY queries # def arrayManipulation(n, queries): # Write your code here arr = array('i', [0] * (n+1)) for a,..

⭐ 나의 풀이 #!/bin/python3 import math import os import random import re import sys import bisect from array import array # # Complete the 'insertionSort' function below. # # The function is expected to return an INTEGER. # The function accepts INTEGER_ARRAY arr as parameter. # def insertionSort(arr): # Write your code here result = 0 result_arr = array('i', [arr[0]]) for i in range(1, len(arr)) : i..

🟨 나의 풀이 #!/bin/python3 import math import os import random import re import sys # # Complete the 'matrixRotation' function below. # # The function accepts following parameters: # 1. 2D_INTEGER_ARRAY matrix # 2. INTEGER r # def matrixRotation(matrix, r): # Write your code here row = len(matrix) col = len(matrix[0]) result = [[0] * col for _ in range(row)] depth = 0 while row - depth > row / 2 and..

⭐ 나의 풀이 #!/bin/python3 import math import os import random import re import sys # # Complete the 'queensAttack' function below. # # The function is expected to return an INTEGER. # The function accepts following parameters: # 1. INTEGER n # 2. INTEGER k # 3. INTEGER r_q # 4. INTEGER c_q # 5. 2D_INTEGER_ARRAY obstacles # dx = [0, 0, -1, 1, -1, -1, 1, 1] dy = [-1, 1, 0, 0, -1, 1, -1, 1] def queens..

⭐ 나의 풀이 #!/bin/python3 import math import os import random import re import sys # # Complete the 'nonDivisibleSubset' function below. # # The function is expected to return an INTEGER. # The function accepts following parameters: # 1. INTEGER k # 2. INTEGER_ARRAY s # def nonDivisibleSubset(k, s) : # Write your code here count_mod = [0] * k for value in s : count_mod[value % k] += 1 answer = min(..

🤗 나의 풀이 #!/bin/python3 import math import os import random import re import sys # # Complete the 'climbingLeaderboard' function below. # # The function is expected to return an INTEGER_ARRAY. # The function accepts following parameters: # 1. INTEGER_ARRAY ranked # 2. INTEGER_ARRAY player # def climbingLeaderboard(ranked, player): # Write your code here result = [] sort_ranked = sorted(set(ranked..

⭐ 나의 풀이 #!/bin/python3 import math import os import random import re import sys # # Complete the 'extraLongFactorials' function below. # # The function accepts INTEGER n as parameter. # def extraLongFactorials(n): # Write your code here if n < 2 : return 1 else : return n * extraLongFactorials(n-1) if __name__ == '__main__': n = int(input().strip()) print(extraLongFactorials(n)) 기본적인 재귀 호출 구현 문제..

Magic Square를 만드는 규칙이 있다. 8 1 6 3 5 7 4 9 2 위는 3*3의 Magic Square이다. 1부터 시작한다. 1의 오른쪽 대각선의 위치에 2를 쓴다. lst[0][1] ➡️ lst[2][2] lst[0][1]의 오른쪽 대각선은 lst[-1][2]이다. lst[-1][2] == lst[2][2] 2의 오른쪽 대각선의 위치에 3을 쓴다. lst[2][2] ➡️ lst[1][0] lst[2][2]의 오른쪽 대각선은 lst[1][3]인데 lst[1][3%3] == lst[1][0] 3의 오른쪽 대각선이 이미 숫자가 있어서 아래에 4를 쓴다. lst[1][0] ➡️ lst[2][0] 위와 같은 과정을 반복 🤗 나의 풀이 #!/bin/python3 import math import o..

🟨 나의 풀이 class Solution { public int solution(int[] cookie) { int answer = 0; for(int i=0; i = right_total && right < cookie.length - 1) { right += 1; right_total += cookie[ri..

🚩 나의 풀이 import java.util.*; class Solution { public int solution(int[][] scores) { int answer = 1; int s1 = scores[0][0]; int s2 = scores[0][1]; int wanho_score = s1 + s2; int tmp = 0; Arrays.sort(scores, new Comparator(){ @Override public int compare(int[] o1, int[] o2) { if (o1[0] o2[1]) return 1; else return -1; } else return -1; } });..