LeetCode-Contains Duplicate II-解题报告

最新推荐文章于 2015-09-02 11:51:31 发布

dinglin0xff

最新推荐文章于 2015-09-02 11:51:31 发布

阅读量280

点赞数

分类专栏： leetcode 文章标签： C++ leetcode

本文链接：https://blog.csdn.net/dd523762588/article/details/46688431

版权

leetcode 专栏收录该内容

69 篇文章 0 订阅

订阅专栏

原链接https://leetcode.com/problems/contains-duplicate-ii/

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

和iii差不多,nums[i] == nums[j]

和III一样的我使用了随机算法。

<span style="font-size:14px;">class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        if (nums.empty())return false;
		srand(time(0));
		for (int i = 0; i < 50; ++i)
		{
			int s = rand() % nums.size();
			for (int j = s + 1; j <= s + k && j < nums.size(); ++j)
			if (nums[s] == nums[j])return true;
		}
		return false;
	}
};</span>