문제: app.codility.com/programmers/lessons/10-prime_and_composite_numbers/peaks/
우와... 45%.... 다시 풀어야 되네ㅠ
if (A.Length < 3) return 0;
int result = 0;
for (int i = 1; i < A.Length - 1; i++)
{
if (A[i] > A[i - 1] && A[i] > A[i + 1])
result++;
}
return result;
'공부하자 > Codility' 카테고리의 다른 글
[Codility] Lesson11. CountSemiprimes (C#) (0) | 2020.11.27 |
---|---|
[Codility] Lesson11. CountNonDivisible (C#) (0) | 2020.11.27 |
[Codility] Lesson10. MinPerimeterRectangle (C#) (0) | 2020.11.27 |
[Codility] Lesson10. Flags (C#) (0) | 2020.11.20 |
[Codility] Lesson10. CountFactors (C#) (0) | 2020.11.20 |