csppass
连续 00 XP登录 / 注册
202336完善程序查找算法提高

寻找被移除的元素:④处应填

题目

完善程序:寻找被移除的元素(接上题)。 int find_missing(vector<int>& nums){ int left = 0, right = nums.size() - 1; while (left < right){ int mid = left + (right - left) / 2; if (nums[mid] - mid == ①){ ②; }else{ ③; } } return ④; } int main(){ int n; cin >> n; vector<int> nums(n); for (int i = 0; i < n; i++) cin >> nums[i]; int missing_number = find_missing(nums); if (missing_number == ⑤) { cout << "Sequence is consecutive" << endl; }else{ cout << "Missing number is " << missing_number << endl; } return 0; } ④处应填( )

考点拆解
查找算法
易错提醒
阅读程序题要按变量变化顺序手推,不要跳步
选择题要检查单位、边界和题目中的否定词