一堆有趣法题.docVIP

一串由17个数字排列成一个圆环，现在从第1个位置开始计数，沿着圆环去掉被3整除的位置和数字，最后留下的是哪些数字？ ??????? private void Test()??????? {??????????? Listint numbers = new Listint();??????????? for (int i = 1; i 18; i++)??????????? {??????????????? numbers.Add(i);??????????? }??????????? Listint results = this.Calculate(numbers, 3);??????????? Console.WriteLine(the remian is following numbers:);??????????? foreach (int i in results)??????????? {??????????????? Console.WriteLine(i.ToString());??????????? }??????? } ??????? private Listint Calculate(Listint numbers, int interval)??????? {??????????? int remainAmount = numbers.Count % interval;??????????? Listint calculatedNumbers = new Listint(); ??????????? for (int i = 0; i numbers.Count; i++)??????????? {??????????????? if (i.Equals(numbers.Count - remainAmount-1))??????????????? {??????????????????? for (int j = 0; j remainAmount; j++)??????????????????? {??????????????????????? int post = numbers.Count - 1 - j;??????????????????????? calculatedNumbers.Insert(0, numbers[post]);??????????????????? }??????????????????? break;??????????????? }??????????????? if ((i + 1) % interval != 0)??????????????? {??????????????????? calculatedNumbers.Add(numbers[i]);??????????????? }??????????? } ??????????? if (calculatedNumbers.Count / interval 0)??????????? {??????????????? return Calculate(calculatedNumbers, interval);??????????? }??????????? else??????????? {??????????????? return calculatedNumbers;??????????? }??????? } 最后结果是 剩下4和11。 一个有趣的算法题 10万个数丢了俩，如何找出从1到100000，随机取出2个数丢弃，剩余的数打乱顺序后放入数组array。要求遍历一次找到被取出的2个数。变量数不超过5个。1 不可另行开辟数组2 不可修改数组array内的元素 代码: #define ARRAY_NUM??(100000-2)int find(int n, const int a[]) //递归找到当前数组中小的没有的数，不知堆栈是否不够大而溢出，当然这个时间复杂度很高{? ?for(int i=0;i? ?{? ?? ?if(a[i]==n+1)? ?? ?{? ?? ?? ? find(++n,a[i]);? ?? ?}? ?}? ?return n+1;}int main(void){??int n1=0,n2;??const int a[ARRAY_NUM];//要找的数组??n1=find(n1,a);//找到丢掉中的小的??n2=find(n1,a);//找到大的} 1. 怎样从100个杂乱的数中挑选出10个最大的数（不允许对这100个数排序）？要求时间