//LeetCode剑指 Offer 03. 数组中重复的数字
class Solution {
public:
int findRepeatNumber(vector<int>& s) {
for (int i = 0; i < s.size(); i++) {
if (s[i] != i) {
if (s[i] == s[s[i]]) return s[i];
swap(s[i], s[s[i]]);
i--;
}
}
return 0;
}
};
LeetCode剑指 Offer 03. 数组中重复的数字
最新推荐文章于 2024-07-19 19:25:43 发布