Can Place Flowers LeetCode solution in Java

1
class Solution {
2
public boolean canPlaceFlowers(int[] flowerbed, int n) {
3
if (flowerbed[0] != 1) {
4
n--;
5
flowerbed[0] = 1;
6
}
7
for (int i = 1; i < flowerbed.length; i++) {
8
if (flowerbed[i - 1] == 1 && flowerbed[i] == 1) {
9
flowerbed[i - 1] = 0;
10
n++;
11
}
12
if (flowerbed[i - 1] != 1 && flowerbed[i] != 1) {
13
flowerbed[i] = 1;
14
n--;
15
}
16
}
17
return (n <= 0) ? true : false;
18
}
19
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0