We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4a32c1c commit e2300c6Copy full SHA for e2300c6
lcof/面试题03. 数组中重复的数字/README.md
@@ -75,7 +75,7 @@ class Solution {
75
class Solution {
76
public:
77
int findRepeatNumber(vector<int>& nums) {
78
- sort(nums.begin(), nums.end());
+ sort(nums.begin(), nums.end());//冒泡
79
for (int i = 0;; ++i) {
80
if (nums[i] == nums[i + 1]) {
81
return nums[i];
0 commit comments