문제: app.codility.com/programmers/lessons/9-maximum_slice_problem/max_slice_sum/
MaxSliceSum coding task - Learn to Code - Codility
Find a maximum sum of a compact subsequence of array elements.
app.codility.com
결과: 84% 다시풀기..
if (A.Length < 1) return 0;
int max = A[0];
int index = A[0];
for (int i = 1; i < A.Length; i++)
{
index += A[i];
if (max < index)
max = index;
if (max < A[i])
{
max = A[i];
index = A[i];
}
}
return max;
'공부하자 > Codility' 카테고리의 다른 글
[Codility] Lesson10. Flags (C#) (0) | 2020.11.20 |
---|---|
[Codility] Lesson10. CountFactors (C#) (0) | 2020.11.20 |
[Codility] Lesson9. MaxProfit (C#) (0) | 2020.11.20 |
[Codility] Lesson9. MaxDoubleSliceSum (C#) (0) | 2020.11.20 |
[Codility] Lesson8. EquiLeader (C#) (0) | 2020.11.20 |