[프로그래머스] 연속 부분 수열 합의 개수
def over_coverage(idx , max_len): if idx > max_len: additional_idx = idx-max_len return additional_idx else: return None def calculate(start, end , elements): # print(start, end) additional_idx = over_coverage(end, len(elements)) if additional_idx: result = sum(elements[start:end])+sum(elements[:additional_idx]) else: result = sum(elements[start:end]) return result def solution(elements): answer..
2024.03.24