NumberOfDiscIntersections
def solution(A):
# write your code in Python 3.6
p = 0
l = len(A)
#print(l)
for i in range(0, l):
#print('stage:', i)
if l <= i+A[i]:
p+=l-i-1
#print('len A ', l-i-1)
else:
p+=A[i]
#print('else ', A[i])
for j in range(i-1, i-A[i], -1):
#print(j)
if j < 0:
break
if i-j+1<=A[j]:
p+=1
#print('back ', 1)
#print(p)
return p
처참하기 짝이 없네요
이래서 코테를 볼 수 있을런지..?