[프로그래머스] 우유와 요거트가 담긴 장바구니 SELECT DISTINCT A.CART_ID FROM (SELECT CART_ID, NAME FROM CART_PRODUCTS WHERE NAME = 'Yogurt') A LEFT JOIN (SELECT CART_ID, NAME FROM CART_PRODUCTS WHERE NAME = 'Milk') B ON A.CART_ID = B.CART_ID WHERE A.NAME IS NOT NULL AND B.NAME IS NOT NULL 알고리즘 2023.10.09
[프로그래머스] 헤비 유저가 소유한 장소 SELECT ID, NAME, HOST_ID FROM PLACES WHERE PLACES.HOST_ID IN (SELECT HOST_ID FROM (SELECT HOST_ID,COUNT(HOST_ID) AS H_CNT FROM PLACES GROUP BY HOST_ID HAVING H_CNT >= 2)A) 알고리즘 2023.10.09
[프로그래머스] 가장 가까운 같은 글자 def solution(s): answer = [] ch = {} for i in range(len(s)): if s[i] in ch: answer.append(i - ch[s[i]]) ch[s[i]] = i else: ch[s[i]] = i answer.append(-1) return answer 알고리즘 2023.10.09
[프로그래머스] 푸드 파이트 대회 def solution(food): answer = '' for fd in enumerate(food[1:]): if fd[1] % 2 == 0: answer += str(fd[0]+1) * (fd[1] // 2) else: answer += str(fd[0]+1) * ((fd[1] - 1) // 2) answer += ('0' + answer[::-1]) return answer 알고리즘 2023.10.09
[프로그래머스] 두 개 뽑아서 더하기 def solution(numbers): answer = list() for i in range(len(numbers)): for j in range(i+1, len(numbers)): if numbers[i] + numbers[j] not in answer: answer.append(numbers[i] + numbers[j]) answer.sort() return answer 알고리즘 2023.10.09
[프로그래머스] 콜라 문제 def solution(a, b, n): answer = 0 while(n >= a): answer += (n // a * b) n = n - (n // a * a) + (n // a * b) return answer 알고리즘 2023.10.07
[프로그래머스] 추억 점수 def solution(name, yearning, photo): answer = [] dic = dict(zip(name, yearning)) for ph in photo: ch = 0 for nm in ph: if nm in list(dic.keys()): ch += dic[nm] answer.append(ch) return answer 알고리즘 2023.10.07
[프로그래머스] 명예의 전당(1) def solution(k, score): answer = [] check = [] for sc in score: check.append(sc) check = sorted(check) if len(check) > k: check.remove(check[0]) answer.append(check[0]) return answer 알고리즘 2023.10.07
[프로그래머스] 카드 뭉치 def solution(cards1, cards2, goal): while True: if len(goal) == 0: return "Yes" if len(cards1) != 0: if cards1[0] == goal[0]: cards1.remove(cards1[0]) goal.remove(goal[0]) continue if len(cards2) != 0: if cards2[0] == goal[0]: cards2.remove(cards2[0]) goal.remove(goal[0]) continue return "No" 알고리즘 2023.10.07
[프로그래머스] 폰켓몬 def solution(nums): answer = 0 lens = len(nums)/2 uq = set(nums) if lens >= len(uq): answer = len(uq) elif lens < len(uq): answer = lens return int(answer) 알고리즘 2023.10.07