-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram40.java
More file actions
60 lines (36 loc) · 1.18 KB
/
program40.java
File metadata and controls
60 lines (36 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*
219. Contains Duplicate II
Easy
4.8K
2.6K
Companies
Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.
Example 1:
Input: nums = [1,2,3,1], k = 3
Output: true
Example 2:
Input: nums = [1,0,1,1], k = 1
Output: true
Example 3:
Input: nums = [1,2,3,1,2,3], k = 2
Output: false
*/
package LeetCode;
public class program40 {
static boolean containsNearbyDuplicate(int[] nums, int k) {
int left = 0;
int right = nums.length-1;
while(left<right){
int diff = Math.abs(left-right);
if(nums[left]==nums[right] && diff<=k){
return true;
}
}
return false;
}
public static void main(String[] args) {
int[] nums = {1,0,1,1};
int k=1;
System.out.println(containsNearbyDuplicate(nums, k));
}
}