230224 [SQL(JOIN)&DFS+BFS&구현문제들 복습]

프로그래머스 인공지능 데브코스 코테

 

def solution(seat):	

	seat.sort()
    
	length = len(seat)
	dp = [0] * length
	target = None
    
	for i in range(length):	
		if seat[i] != target:
			dp[i] = 1
			target = seat[i]
		else:
			continue
            
	return sum(dp)