0125_TIL

def sum_list(numbers):
    rlt = 0
    for num_lst in numbers:
        for num in num_lst:
            rlt += num
    return rlt
def sum_list(numbers):
    rlt = 0
    for i in range(len(numbers)):
        for j in range(len(numbers[i])):
            rlt += numbers[i][j]
    return rlt
def sum_list(numbers):
    rlt = 0
    i = 0
    while i < len(numbers):
        j = 0
        while j < len(numbers[i]):
            rlt += numbers[i][j]
            j += 1
        i += 1
    return rlt

2차원 배열

Student [A][B]

​ A 는 가로줄 B는 세로줄

def student_score(score_lst):
    for j in range(len(score_lst[0])):
        total = 0
        for i in range(len(score_lst)):
            # print(score_lst[i][j])
            total += score_lst[i][j]
        # print("-----")
        print(total)
students = [
 [100, 80, 100, 10],
 [90, 90, 60, 10],
 [80, 80, 80, 10]
]
student_score(students)

10번

def get_final_position(N, mat, moves):
    pass
    # 여기에 코드를 작성하여 함수를 완성합니다.

    
    # mat => 위치를 추출
    for i in range(len(mat)):
        for j in range(len(mat)):
            if mat[i][j] == 1:
                pos_x=i
                pos_y=j
    # Moves에서 M 값을 추출
    for M in moves:
        if M==0:
            pos_x -=1
        elif M==1:
            pos_x +=1
        elif M==2:
            pos_y -=1
        elif M==3:
            pos_y +=1
            
    # N 의 값이 범위를 넘어가는지 확인    
    if (pos_x > N) or (pos_y > N) or (pos_x < 0) or (pos_y <0 ):
        return None
    else:
        return [pos_x,pos_y]