---
tags: Data Structure I, LeetCode
disqus: HackMD
---

# 包含重複項(Contains Duplicate)

## 虛擬碼

function bubble_sort (array, length) {
    var i, j;
    for(i from 0 to length-1){
        let com_a = nums[i];
        for(j from i+1 to length-1){
            if (array[j] === com_a)
                true
        }
    }
    false
}

## 解題

[217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/description/?envType=study-plan&id=data-structure-i)

### 題目說明

給定一個整數陣列，returnif 任何值在陣列中至少出現兩次，returnif 每個元素都是不同的。
**就是：給你一個array, 問你這個arrary有沒有重複的元素**


### 解法

第一種
**Javascript**

/**
 * @param {number[]} nums
 * @return {boolean}
 */
var containsDuplicate = function(nums) {
    for (let i = 0; i < nums.length; i++) {
        let com_a = nums[i];
        for (let j = i + 1; j < nums.length; j++) {
           if(nums[j] === com_a){
               return true;
            }
        }
    }
    return false
};

第二種 [參考](https://skyyen999.gitbooks.io/-leetcode-with-javascript/content/questions/217md.html)

/**
 * @param {number[]} nums
 * @return {boolean}
 */
var containsDuplicate = function(nums) {
    let com_a = [];
    for(let i of nums){
        if(com_a.indexOf(nums[i])<0){
            com_a.push(nums[i]);
        } else {
            return true;
        }
    }
    return false;
};

> [name=@denny0628] [time=Tue, Nov 23, 2022 14:45 PM] [color=#907bf7]