Flower Planting With No Adjacent
You have n gardens, labeled from 1 to n, and an array paths where paths[i] = [xi, yi] describes a bidirectional path between garden xi and garden yi. 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 choice as an array answer, where answer[i] is the type of flower planted in the (i+1)^th 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]Gardens 1 and 2, 2 and 3, and 3 and 1 all have different flower types, so this is a valid answer.
Example 2
Input
n = 4, paths = [[1,2],[3,4]]Output
[1,2,1,2]The only connected pairs are gardens 1 and 2 and gardens 3 and 4, and each pair has different flower types.
Constraints
- 1 <= n <= 10^4
- 0 <= paths.length <= 2 * 10^4
- paths[i].length == 2
- 1 <= xi, yi <= n
- xi != yi
- Every garden has at most 3 paths coming into or leaving it.