C++面试题——数组

一个长度为N的整形数组，数组中每个元素的取值范围是[0,n-1],判断该数组否有重复的数

#include<iostream>
using namespace std;

bool IsDuplicateNumber(int *array, int n)
{
	for (int i = 0; i<n; i++)
	{
		if (array[i] != i)
		{
			if (array[i] != array[array[i]])
				swap(array[i], array[array[i]]);
			else
				return true;
		}
	}
	return false;
}

int main() {
	int a[] = { 1,2,3,4,5,6 };
	cout << IsDuplicateNumber(a, 6) << endl;
}

Leetcode 26
删除排序数组的重复项

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;

class Solution {
public:
	int removeDuplicates(vector<int>& nums) {
		if (nums.size() == 1||nums.size() == 0) {
			return  nums.size();
		}
		//0 0 0 1 1 2 2 3 3 4
		//1 1 2
		int x = 0;
		for (int i = 0; i<nums.size(); i++) {
			if (i - 1 >= 0) {
				if (nums[i] != nums[i - 1]) {
					nums[x + 1] = nums[i];
					x += 1;
				}
			}
		}
		return x + 1;
	}
};


int main() {
	vector<int> vec;
	int n, x;
	while (cin >> n) {
		for (int i = 0; i < n; i++) {
			cin >> x;
			vec.push_back(x);
		}
		Solution sol = Solution();
		int count = sol.removeDuplicates(vec);
		cout << count << endl;
		for (int i = 0; i < count; i++) {
			cout << vec[i] << " ";
		}
		cout << endl;
		vec.clear();
	}
	
}