[LeetCode/Kotlin]Easy - 219. Contains Duplicate II

Contains Duplicate II - LeetCode

문제

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

Constraints:

• 1 <= nums.length <= 105
• 109 <= nums[i] <= 109
• 0 <= k <= 105

풀이

최종 소스코드

import kotlin.math.abs

class Solution {
    fun containsNearbyDuplicate(nums: IntArray, k: Int): Boolean {
        for (i in 0 until nums.size-1) {
            for (j in i+1 until nums.size) {
                if (nums[i] == nums[j] && abs(i-j) <= k) return true
            }
        }
        return false
    }
}