Restore the array from adjacent pairs

• dsa_problem #gyan_pelo
• there should be a complete chain, the key is to determine the number which don’t have duplicate.
• I can do it with map with 2ntime_complexity and n memory.

pseudo_code

nums = [[4,-2],[1,4],[-3,1]]
ans = [-2,4,1,-3]