g*****u
发帖数: 298 | 1 # You are given an array with integers between 1 and 1,000,000. One integer
is in the array twice. How can you determine which one? Can you think of a
way to do it using little extra memory.
# You are given an array with integers between 1 and 1,000,000. One integer
is missing. How can you determine which one? Can you think of a way to do it
while iterating through the array only once. Is overflow a problem in the
solution? Why not?
#Implement Shuffle given an array containing a deck of cards a |
|
