프로그래머스 <배열 비교하기> Lv.0

def solution(arr1, arr2):
    n1 = sum(arr1)
    n2 = sum(arr2)
    if len(arr1) > len(arr2):
        return 1
    elif len(arr1) < len(arr2):
        return -1
    elif len(arr1) == len(arr2):
        if n1 > n2:
            return 1
        elif n1 < n2:
            return -1
        else:
            return 0

 

 

간결하게

def solution(arr1, arr2):
    return (
   		1 if len(arr1)>len(arr2) 
        else -1 if len(arr1)<len(arr2) 
        else (1 if sum(arr1)>sum(arr2) else -1 if sum(arr1)<sum(arr2) else 0)
    )