217. Contains Duplicate

package LeetCode_217

/**
 * 217. Contains Duplicate
 * https://leetcode.com/problems/contains-duplicate/
 * Given an array of integers, find if the array contains any duplicates.
Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
Example 1:
Input: [1,2,3,1]
Output: true

Example 2:
Input: [1,2,3,4]
Output: false

Example 3:
Input: [1,1,1,3,3,4,3,2,4,2]
Output: true
 * */
class Solution {
    /*
    * solution: HashMap, Time:O(n), Space:O(n)
    * */
    fun containsDuplicate(nums: IntArray): Boolean {
        val map = HashMap<Int, Int>()
        for (num in nums) {
            map.put(num, map.getOrDefault(num, 0) + 1)
            if (map.get(num)!! > 1) {
                return true
            }
        }
        return false
    }
}