605. Can Place Flowers
Suppose 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  they would compete for water and both would die.
Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty), and a number n, return if n new flowers can be planted in it without violating the noadjacentflowers rule.
Example 1:
Input: flowerbed = [1,0,0,0,1], n = 1 Output: True
Example 2:
Input: flowerbed = [1,0,0,0,1], n = 2 Output: False
Note:
 The input array won't violate noadjacentflowers rule.
 The input array size is in the range of [1, 20000].
 n is a nonnegative integer which won't exceed the input array size.
class Solution { public boolean canPlaceFlowers(int[] flowerbed, int n) { for(int i=0; i<flowerbed.length; i++){ if(n == 0){ return true; } if(flowerbed[i] == 1){ continue; } boolean left = (i > 0) ? flowerbed[i  1] == 0 : flowerbed[i] == 0; boolean right = (i < flowerbed.length  1) ? flowerbed[i + 1] == 0 : flowerbed[i] == 0; if(left && right && flowerbed[i] == 0){ flowerbed[i] = 1; n; } } return n <= 0; } }
[문제] https://leetcode.com/problems/canplaceflowers/

720. Longest Word in Dictionary

225. Implement Stack using Queues

56. Merge Intervals

844. Backspace String Compare

222. Count Complete Tree Nodes

697. Degree of an Array

605. Can Place Flowers

724. Find Pivot Index

448. Find All Numbers Disappeared in an Array

628. Maximum Product of Three Numbers

532. Kdiff Pairs in an Array

897. Increasing Order Search Tree

872. LeafSimilar Trees

876. Middle of the Linked List

203. Remove Linked List Elements

997. Find the Town Judge

270. Closest Binary Search Tree Value

687. Longest Univalue Path

783. Minimum Distance Between BST Nodes

235. Lowest Common Ancestor of a Binary Search Tree