219. Contains Duplicate II

Problems:

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.

Solutions:

#include<iostream>
#include<string>
#include<vector>


using namespace std;


class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
for (int i = 0; i < nums.size(); i++)
{
for (int j = i + 1; j < nums.size(); j++)
{
if (j - i > k)
break;
if (nums[i] == nums[j])
return true;
}
}
return false;
}
};


int main()
{
Solution s;
vector<int> nums;
int k;
cin >> k;
nums.push_back(1);
nums.push_back(2);
nums.push_back(3);
nums.push_back(4);
nums.push_back(5);
nums.push_back(1);
bool b;
b = s.containsNearbyDuplicate(nums, k);
cout << s.containsNearbyDuplicate(nums, k) << endl;
int n;
cin >> n;
return 0;
}