지니 Programming

Python def solution(s): answer = [int(n) for n in s.split()] return f"{min(answer)} {max(answer)}"

Python from math import sqrt def solution(n, k): answer = 0 split_number = [int(i) for i in mod(n, k).split("0") if i != '' and int(i) > 1] for number in split_number: is_ = True for num in range(2, int(sqrt(number)) + 1): if number % num == 0: is_ = False break if is_: answer += 1 return answer def mod(n, k): if n

def solution(n, words): word_dict = dict() person_index = 1 last_word = words[0][0] for i, word in enumerate(words): if word_dict.get(word) or last_word != word[0]: return [person_index, i // n + 1] word_dict[word] = True person_index = (person_index) % n + 1 last_word = word[-1] return [0, 0] Python

Python from itertools import combinations def solution(lines): points = [] combi_lines = list(combinations(lines, 2)) for line in combi_lines: A, B, E = line[0] C, D, F = line[1] if (A * D - B * C) == 0: continue x = (B * F - E * D) / (A * D - B * C) y = (E * C - A * F) / (A * D - B * C) if x.is_integer() and y.is_integer(): points.append((int(x), int(y))) xs = [i[0] for i in points] ys = [i[1] ..

Python def solution(s): #(와 )의 개수가 맞으므로 if s[0] == ")" or s[-1] == "(" or s.count("(") != s.count(")"): return False s = s.replace("()", "")#replace하게 되면 맞는 거면 (())()이런식이므로 처음과 끝만 잘 맞는지 확인해주면 된다. if len(s) > 0 and (s[0] == ")" or s[-1] == "("): return False return True # 효율성 시간 초과 # answer = True # if s[0] == ")" or s[-1] == "(" or s.count("(") != s.count(")"): # return False # while len(s) > 0:..

Python def solution(n): compare_n = n n1_count = bin(n)[2:].count("1") while True: compare_n += 1 if bin(compare_n)[2:].count("1") == n1_count: return compare_n

Python def solution(numbers): answer = [] for number in numbers: #0을 앞에 붙여야되는데 해당 이유에 대해서는 더 생각이 필요 start_number = "0" + bin(int(number))[2:] if start_number[-2:] in ["00", "01", "10"]: answer.append(number + 1) continue #뒤부터 검사해서 0이 나오기 시작하는 index (length - (index + 1)) index = start_number.rfind("0") count = len(start_number) - (index + 1) answer.append(number + 2 ** (count - 1)) return answer..

Python def solution(A,B): answer = 0 A.sort(reverse=True) B.sort() for i in range(len(A)): answer += A[i] * B[i] return answer

Python - #처리를 까먹고 안 해서 시간이 오래 걸렸다. 문자열은 re를 이용하니 좀 더 수월하게 풀 수 있었다. + 다른 사람 풀이를 봤는데 C#은 소문자 c로 변경하여 풀었다. 좋은 방법인 거 같다. import datetime import re def solution(m, musicinfos): answer = [] #datetime.datetime(2022, 4, 1) for index, musicinfo in enumerate(musicinfos): start, end, title, rhythm = musicinfo.split(",") total = '' start_time = start.split(":") end_time = end.split(":") #시간 구하는 다른 방법 # comp..

Python import re def solution(files): answer = [] for index, file in enumerate(files): number = re.findall(r'\d+', file)[0] head = file[:file.find(number)] tail = file[len(head) + len(number):] answer.append((head, number, tail, index)) answer = sorted(answer, key=lambda x: (x[0].lower(), int(x[1]), x[3])) answer = ["".join(v[:-1]) for v in answer] return answer