add solution problem 507

hiepndd · hiepndd · commit e21eea81a270 · 2019-03-27T16:13:25.000+07:00
diff --git a/src/0507.Perfect-Number/README.md b/src/0507.Perfect-Number/README.md
@@ -0,0 +1,19 @@
+# [507. Perfect Number][title]
+
+## Description
+
+We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.
+
+Now, given an integer n, write a function that returns true when it is a perfect number and false when it is not.
+
+**Example 1:**
+
+```
+Input: 28
+Output: True
+Explanation: 28 = 1 + 2 + 4 + 7 + 14
+```
+
+
+
+[title]: https://leetcode.com/problems/perfect-number/
diff --git a/src/0507.Perfect-Number/Solution.go b/src/0507.Perfect-Number/Solution.go
@@ -0,0 +1,17 @@
+package Solution
+
+func checkPerfectNumber(num int) bool {
+	if num == 0 {
+		return false
+	}
+	sum := 0
+
+	for i := 1; i <= num/2; i++ {
+		if num%i == 0 {
+			sum += i
+
+		}
+
+	}
+	return sum == num
+}
diff --git a/src/0507.Perfect-Number/Solution_test.go b/src/0507.Perfect-Number/Solution_test.go
@@ -0,0 +1,26 @@
+package Solution
+
+import (
+	"reflect"
+	"testing"
+)
+
+func TestCheckPerfectNumber(t *testing.T) {
+	cases := []struct {
+		name     string
+		input    int
+		expected bool
+	}{
+		{"Test case 1", 28, true},
+	}
+
+	for _, testcase := range cases {
+		t.Run(testcase.name, func(t *testing.T) {
+			got := checkPerfectNumber(testcase.input)
+			if !reflect.DeepEqual(got, testcase.expected) {
+				t.Fatalf("expected: %v, but got: %v, with input: %v",
+					testcase.expected, got, testcase.input)
+			}
+		})
+	}
+}
