[Python] 프로그래머스 Lv.0 -11

1. 정수찾기

def solution(num_list, n):
    return int(n in num_list)

2. 주사위게임1

def solution(a, b):
    if a%2 == 1 and b%2 == 1:
        return a**2+b**2
    elif a%2 == 0 and b%2 ==0:
        return abs(a-b)
    else:
        return 2*(a+b)

3. 날짜 비교하기

def solution(date1, date2):
    for a,b in zip(date1,date2):
        if a == b:
            continue
        elif a < b:
            return 1
        else:
            return 0
    return 0

or

def solution(date1, date2):
    return int(date1 < date2)

4. 커피심부름

def solution(order):
    answer = 0
    for i in order:
        if "latte" in i:
            answer += 5000
        else:
            answer += 4500
    return answer

5. 그림확대

def solution(picture, k):
    answer = []
    for i in picture:
        res=""
        for j in i:
            res+= j*k
        for e in range(k):
            answer.append(res)
    return answer

6. 조건에 맞게 수열 변환하기3

def solution(arr, k):
    answer = []
    if k % 2 == 1:
        for i in arr:
            answer.append(i*k)
    else:
        for i in arr:
            answer.append(i+k)
    return answer

7. I로 만들기

def solution(myString):
    answer = ''
    for i in myString:
        if i < "l":
            answer +="l"
        else:
            answer += i
    return answer

8. 특별한 이차원 배열1

def solution(n):
    answer = [[0 for i in range(n)]for i in range(n)]
    for i in range(n):
        answer[i][i] = 1
    return answer

9. 특별한 이차원 배열2

def solution(arr):
    for i in range(len(arr)):
        for j in range(len(arr)):
            if arr[i][j] != arr[j][i]:
                return 0
    return 1

10. 정사각형으로 만들기

def solution(arr):
    a = len(arr)
    b = len(arr[0])
    arr2 =[0]*b
    if a > b:
        for i in range(a):
            for j in range(a-b):
                arr[i].append(0)
    elif a < b:
        arr2=[0]*b
        for i in range(b-a):
            arr.append(arr2)
    return arr

11. 이차원 배열 대각선 순회하기

def solution(board, k):
    answer = 0
    for i in range(len(board)):
        for j in range(len(board[1])):
            if i+j <= k:
                answer += board[i][j]
    return answer