##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LeetCode 645
You have a set which originally contains numbers from to . One number got duplicated to another number, making one number appear twice and one number missing.
Find the number that occurs twice and the number that is missing. Return them as .
For example, if the array is , the answer is because appears twice and is missing.