[Python 코드카타] 37번 ~ 38번 (프로그래머스)

37번 행렬의 덧셈

def solution(arr1, arr2):
    answer = []
    for i in range(len(arr1)):
        a = []
        for j in range(len(arr1[i])):
            a.append(arr1[i][j]+arr2[i][j])
        answer.append(a)
    return answer

> 창의적인 답

def solution(A,B):
    answer = [[c + d for c, d in zip(a,b)] for a, b in zip(A,B)]
    return answer

> ?

def solution(A,B):
    return [list(map(sum, zip(*x))) for x in zip(A, B)]

 

38번 직사각형 별찍기

> 못 푼 문제..

a, b = map(int, input().strip().split(' '))
answer = ('*'*a +'\n')*b
print(answer)

> 또는

a, b = map(int, input().strip().split(' '))

for i in range(b):
    for j in range(a):
        print('*', end='')
    print('')