×

Loading...

把数组从头到尾走一遍,把1放到数组第1个,2放到数组第2个。。如果有相同的把第二个开始变成0。再走一遍找出0的位置。

urfr (urfr)
(#240086@0)
2001-10-28 -04:00
This post has been archived. It cannot be replied.
Page address has been copied. To share, click to copy page address.
Share Online by QR Code

Back To Topic: 我也来道微软试题。一个数组长度99, 由1-100中的99个数字组成。请给出一个最快算法,用尽可能少的内存,算出不在数组中的数字。

Back To Forum: HOME枫下论坛枫下论坛主坛枫下拾英心情随笔