Flower Planting With No Adjacent LeetCode solution in Python

1
class Solution:
2
    def gardenNoAdj(self, n: int, paths: List[List[int]]) -> List[int]:
3
        g = defaultdict(list)
4
        for u, v in paths:
5
            g[u - 1].append(v - 1)
6
            g[v - 1].append(u - 1)
7
        ans = [0] * n
8
        for i in range(n):
9
            c = [1, 2, 3, 4]
10
            for j in g[i]:
11
                if ans[j] in c:
12
                    c.remove(ans[j])
13
            ans[i] = c.pop()
14
        return ans