NumberOfDiscIntersections 썸네일형 리스트형 [Codility] Lesson 6 : NumberOfDiscIntersections - JAVA 문제 We draw N discs on a plane. The discs are numbered from 0 to N − 1. An array A of N non-negative integers, specifying the radiuses of the discs, is given. The J-th disc is drawn with its center at (J, 0) and radius A[J]. We say that the J-th disc and K-th disc intersect if J ≠ K and the J-th and K-th discs have at least one common point (assuming that the discs contain their borders). The fig.. 더보기 이전 1 다음