🥉

Can Place Flowers

Created

2022/01/18 05:19

문제 번호

605

카테고리

Array

Greedy

Can Place Flowers - LeetCode

You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.

https://leetcode.com/problems/can-place-flowers/

Code

제출 날짜	시간	메모리
2021/01/18	12 ms	6.3 MB

// 605. Can Place Flowers
//
// https://leetcode.com/problems/can-place-flowers/

// canPlaceFlowers function checks whether planting n flowers is possible or not.
// Adjacent planting is not allowed.
// Just iterating the blocks on the flowerbed, and check the empty field whether planting is possible or not.
func canPlaceFlowers(flowerbed []int, n int) bool {
	flowerbed = append(append([]int{0}, flowerbed...), 0)
	for i := 1; i < len(flowerbed)-1; i++ {
		if flowerbed[i-1] == 0 && flowerbed[i] == 0 && flowerbed[i+1] == 0 {
			flowerbed[i] = 1
			n--
		}
	}
	return n <= 0
}
Go
복사