C# 알고리즘 코드카타
59. 덧칠하기
잼잼재미
2023. 12. 18. 09:18
using System;
public class Solution {
public int solution(int n, int m, int[] section) {
int answer = 0;
int[] paint = new int[n];
for (int i = 0; i < n; ++i)
{
paint[i] = 1;
}
for (int i = 0; i < section.Length; ++i)
{
paint[section[i] - 1] = 0;
}
for(int i = 0; i < paint.Length; ++i)
{
if(paint[i] == 0)
{
for (int j = 0; j < m; ++j)
{
int arrayLength = i + j;
if (arrayLength > paint.Length - 1) arrayLength = paint.Length - 1;
paint[arrayLength] = 1;
}
answer++;
}
}
return answer;
}
}