1042 - Flower Planting With No Adjacent.

Medium

You have n gardens, labeled from 1 to n, and an array paths where <code>pathsi = x_i, y_i</code> describes a bidirectional path between garden <code>x_i</code> to garden <code>y_i</code>. In each garden, you want to plant one of 4 types of flowers.

All gardens have at most 3 paths coming into or leaving it.

Your task is to choose a flower type for each garden such that, for any two gardens connected by a path, they have different types of flowers.

Return any such a choice as an array answer, where answer[i] is the type of flower planted in the <code>(i+1)^th</code> garden. The flower types are denoted 1, 2, 3, or 4. It is guaranteed an answer exists.

Example 1:

Input: n = 3, paths = [1,2,2,3,3,1]

Output: 1,2,3

Explanation:

Gardens 1 and 2 have different types.

Gardens 2 and 3 have different types.

Gardens 3 and 1 have different types.

Hence, 1,2,3 is a valid answer. Other valid answers include 1,2,4, 1,4,2, and 3,2,1.

Example 2:

Input: n = 4, paths = [1,2,3,4]

Output: 1,2,1,2

Example 3:

Input: n = 4, paths = [1,2,2,3,3,4,4,1,1,3,2,4]

Output: 1,2,3,4

Constraints:

• <code>1 <= n <= 10⁴</code>

• <code>0 <= paths.length <= 2 * 10⁴</code>

• paths[i].length == 2

• <code>1 <= x_i, y_i<= n</code>

• <code>x_i != y_i</code>

• Every garden has at most 3 paths coming into or leaving it.