1743. Restore the Array From Adjacent Pairs
Description
There is an integer array nums
that consists of n
unique elements, but you have forgotten it. However, you do remember every pair of adjacent elements in nums
.
You are given a 2D integer array adjacentPairs
of size n - 1
where each adjacentPairs[i] = [ui, vi]
indicates that the elements ui
and vi
are adjacent in nums
.
It is guaranteed that every adjacent pair of elements nums[i]
and nums[i+1]
will exist in adjacentPairs
, either as [nums[i], nums[i+1]]
or [nums[i+1], nums[i]]
. The pairs can appear in any order.
Return the original array nums
. If there are multiple solutions, return any of them.
Example 1:
Input: adjacentPairs = [[2,1],[3,4],[3,2]] Output: [1,2,3,4] Explanation: This array has all its adjacent pairs in adjacentPairs. Notice that adjacentPairs[i] may not be in left-to-right order.
Example 2:
Input: adjacentPairs = [[4,-2],[1,4],[-3,1]] Output: [-2,4,1,-3] Explanation: There can be negative numbers. Another solution is [-3,1,4,-2], which would also be accepted.
Example 3:
Input: adjacentPairs = [[100000,-100000]] Output: [100000,-100000]
Constraints:
nums.length == n
adjacentPairs.length == n - 1
adjacentPairs[i].length == 2
2 <= n <= 105
-105 <= nums[i], ui, vi <= 105
- There exists some
nums
that hasadjacentPairs
as its pairs.
Solution
restore-the-array-from-adjacent-pairs.py
class Solution:
def restoreArray(self, adjacentPairs: List[List[int]]) -> List[int]:
neigh = collections.defaultdict(list)
res = []
for a,b in adjacentPairs:
neigh[a].append(b)
neigh[b].append(a)
for nei in neigh:
if len(neigh[nei]) == 1:
res.append(nei)
res.append(neigh[nei][0])
break
while len(res) < len(adjacentPairs) + 1:
prev, head = res[len(res)-2], res[-1]
nei = neigh[head]
if nei[0] == prev:
res.append(nei[1])
else:
res.append(nei[0])
return res