I found an interesting problem on 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

I tried it in Python, but could not do it. Can you solve it?
class Solution:
     def containsDuplicate(self, nums):
         """
         :type nums: List[int]
         :rtype: bool
         """
         
         diction = {}
         flag = 0
         for number in nums:
             if number not in diction:
                 diction[number] = 1
             else:
                 flag = 1
                 break
         if flag == 1:
             return True
         else:
             return False