面试题 08.03. 魔术索引 - 力扣(LeetCode)
简单题
class Solution {
public:
int findMagicIndex(vector<int>& nums) {
for(int i = 0; i < nums.size(); ++i){
if(nums[i] == i) return i;
}
return -1;
}
};
面试题 08.03. 魔术索引 - 力扣(LeetCode)
简单题
class Solution {
public:
int findMagicIndex(vector<int>& nums) {
for(int i = 0; i < nums.size(); ++i){
if(nums[i] == i) return i;
}
return -1;
}
};