Leetcode Problem 1042. Flower Planting With No Adjacent

1042. Flower Planting With No Adjacent

Leetcode Solutions

Greedily Assign Flowers

  1. Create an adjacency list to represent the graph of gardens and their paths.
  2. Initialize an array res to store the flower type for each garden, with a default value of 0 (unassigned).
  3. For each garden i from 1 to n: a. Create an array colors to keep track of the colors used by the neighbors of garden i. b. Iterate through the neighbors of garden i and mark their flower types in the colors array. c. Find the lowest number flower (1 to 4) that is not used by the neighbors and assign it to garden i.
  4. Return the res array containing the flower types for each garden.
UML Thumbnail

Brute Force with Adjacency Checks

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...