Merge pull request 6boris#54 from hiepndd/develop

Add solution problem 0217

Author: 6boris

src/0217.Contains-Duplicate/README.md

@@ -0,0 +1,30 @@
+# [217. Contains Duplicate][title]
+
+## Description
+
+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
+```
+
+[title]: https://leetcode.com/problems/contains-duplicate/

src/0217.Contains-Duplicate/Solution.go

@@ -0,0 +1,15 @@
+package Solution
+
+func containsDuplicate(nums []int) bool {
+	disct := make(map[int]bool, len(nums))
+
+	for _, number := range nums {
+		if disct[number] {
+			return true
+		} else {
+			disct[number] = true
+		}
+	}
+	return false
+
+}

src/0217.Contains-Duplicate/Solution_test.go

@@ -0,0 +1,28 @@
+package Solution
+
+import (
+	"reflect"
+	"testing"
+)
+
+func TestConTainsDuplicate(t *testing.T) {
+	cases := []struct {
+		name    string
+		inputs  []int
+		expects bool
+	}{
+		{"Test case 1", []int{1, 2, 3, 1}, true},
+		{"Test case 2", []int{1, 2, 3, 4}, false},
+		{"Test case 3", []int{1, 1, 1, 3, 3, 4, 3, 2, 4, 2}, true},
+	}
+
+	for _, testcase := range cases {
+		t.Run(testcase.name, func(t *testing.T) {
+			result := containsDuplicate(testcase.inputs)
+			if !reflect.DeepEqual(result, testcase.expects) {
+				t.Fatalf("expected: %v, but got: %v, with input: %v ", testcase.expects, result, testcase.inputs)
+			}
+
+		})
+	}
+}