【LeetCode & 劍指offer刷題】陣列題5:3 陣列中重複的數字(287. Find the Duplicate Number)
阿新 • • 發佈:2019-01-05
【LeetCode & 劍指offer 刷題筆記】目錄(持續更新中...)
287 . Find the Duplicate Number Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.-
You
must not
- You must use only constant, O (1) extra space.
-
Your runtime complexity should be
less than
O
(
n
2
).
- There is only one duplicate number in the array, but it could be repeated more than once.