[52일차] TIL : AWS, 알고리즘 풀기

부족한 금액 계산하기

 

"""""
성우님
def solution(price, money, count):
    answer = 0
    num = 0
    pricecount = 0
    while num < count:
        num += 1
        pricecount += price * num
    answer += pricecount - money
    if money < pricecount:
        return answer
    elif money >= pricecount:
        return 0
print(solution(3,20,4))
"""
"""
재준님
def solution(price, money, count):
    answer = -1
    sum_price = 0
    for i in range(1,(count+1)):
        sum_price += price*i
        if sum_price > money:
            answer=sum_price-money
        else:
            answer=0
    return answer
    while count > 1:
"""​

while의 조건 부분이 num이 4가 되면 while이 멈추게 된다.

sorted key lambda

출처 https://daeun-computer-uneasy.tistory.com/74?category=983126

• 최빈값 구하기

def solution(array):
    answer = 0
    a_dict = {}
    for i in array:
        if i not in a_dict:
            a_dict[i] = 1
        else:
            a_dict[i] += 1
    
    sorted_a = sorted(a_dict.items(),reverse=True,key=lambda x:x[1])
    if len(sorted_a) > 1:
        if sorted_a[0][1] != sorted_a[1][1]:
            answer = sorted_a[0][0]
        else:
            answer = -1
    else:
        answer = sorted_a[0][0]
    return answer

문제를 잘 봐야한다. answer는 최빈값을 구하는 것이다. 최빈값의 빈도수를 구하는게 아니라!

 

배열 두 배 만들기

def solution(numbers):
    answer = []
    for i in numbers:
        answer.append(i * 2)
    return answer

 

배열 뒤집기

def solution(num_list):
    answer = []
    for i in range(len(num_list)):
        answer.append(num_list[(len(num_list)-1)-i])
    return answer

 

문자열 뒤집기

def solution(my_string):
    answer = ''
    for i in range(len(my_string)):
        answer += my_string[(len(my_string)-1)-i]
    return answer

 

가위 바위 보

def solution(rsp):
    answer = ''
    for i in rsp:
        if i == '2':
            answer += '0'
        elif i == '0':
            answer += '5'
        else:
            answer += '2'
    return answer

 

• 점의 위치 구하기

def solution(dot):
    answer = 0
    if dot[0] > 0 and dot[1] > 0:
        answer = 1
    elif dot[0] < 0 and dot[1] > 0:
        answer = 2
    elif dot[0] < 0 and dot[1] < 0:
        answer = 3
    elif dot[0] and dot[1] < 0:
        answer = 4
    return answer

 

• 최댓값 만들기 (1)

def solution(numbers):
    answer = 0
    numbers.sort(reverse=True)
    answer = numbers[0] * numbers[1]
    return answer

 

문자열 정렬하기

def solution(my_string):
    answer = []
    for i in my_string:
        if i in ['0','1','2','3','4','5','6','7','8','9']:
            answer.append(int(i))
            answer.sort()
    return answer

 

중복된 문자 제거

def solution(my_string):
    answer = ''
    for i in my_string:
        if i not in answer:
            answer += i
    return answer

 

대문자와 소문자

def solution(my_string):
    answer = ''
    for i in my_string:
        if i.islower():
            answer += i.upper()
        else:
            answer += i.lower()
    return answer

인덱스 바꾸기

def solution(my_string, num1, num2):
    answer = ''
    a_list = list(my_string)
    a_list[num1],a_list[num2] = a_list[num2],a_list[num1]
    answer = ''.join(a_list)
    return answer

• 배열의 유사도

def solution(s1, s2):
    answer = 0
    for i in s1:
        if i in s2:
            answer += 1
    return answer

숫자 찾기

def solution(num, k):
    answer = 0
    if str(k) in str(num):
        answer += (str(num).index(str(k))+1)
    else:
        answer += -1
    return answer​

문자열 정렬하기 2

def solution(my_string):
    answer = ''
    a = sorted(my_string.lower())
    b = ''.join(a)
    answer = b
    return answer

머쓱이보다 키 큰 사람

def solution(array, height):
    answer = 0
    for i in array:
        if height < i:
            answer += 1
    return answer