코딜리티 lesson16 (greedy Algorithm), MaxNonoverlappingSegments, TieRopes

MaxNonoverlappingSegments

def solution(A, B):
    N = len(A)
    if N == 0:
        return 0
    if N == 1:
        return 1

    end_point = B[0]
    cnt = 1
    for i in range(1, N):
        if end_point < A[i]:
            end_point = B[i]
            cnt += 1
    return cnt

 

TieRopes

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(K, A):
    
    line = 0
    cnt = 0
    
    for a in A:
        line += a
        if line >= K:
            line = 0
            cnt += 1

    return cnt