Want to know:
counting sort?把值为i的放到i - 1位置上最后遍历,不对应的就是缺失的 for (int i = 0; i < nums.length; i++) { while (nums[i] != i + 1 && nums[i] != nums[nums[i] - 1]) { int tmp = nums[i]; nums[i] = nums[tmp - 1]; nums[tmp - 1] = tmp; } } List<Integer> res = new ArrayList<Integer>(); for (int i = 0; i < nums.length; i++) { if (nums[i] != i + 1) { res.add(i + 1); } }
Get a detailed, AI-powered explanation for this question and thousands more on StudyFetch.
Get the Answer for FreeHow StudyFetch Helps You Master This Topic
AI-Powered Answers
Get instant, detailed explanations powered by AI that understands your course material.
Deep Understanding
Go beyond surface-level answers with step-by-step breakdowns and examples.
Personalized Learning
Spark.E adapts to your learning style and helps you connect ideas.
Practice & Test
Turn any question into flashcards, quizzes, and practice tests to solidify your knowledge.
Explore More Questions
- L'effet Rosenthal ne concerne pas les expériences réalisées avec les animaux car ces expériences ne sont jamais affectées par le biais lié aux attentes du sujet
- Pour les multiplications et les divisions, le résultas ne doit jamais comporter plus de chiffres significatifs que le nombre qui en a le moins. Vrai ou faux?
- Required Landing Distance figures include what factors for a 'dry' / 'wet' runway? A. 1.25 / 1.5 1 B. 1.67 / 1.92 C. 1.5 / 2.0