44.leetcode題目：268. Missing Number（位操作沒想到）
題目：
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
For example,
Given nums = [0, 1, 3] return 2.
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
我覺得好類似於腦筋急轉彎啊，簡單，不寫了。但是好像可以用位操作，對位操作不熟練。
注意！
本站转载的文章为个人学习借鉴使用，本站对版权不负任何法律责任。如果侵犯了您的隐私权益，请联系我们删除。