diff --git a/Algorithms/0496. Next Greater Element I/496. Next Greater Element I.go b/Algorithms/0496. Next Greater Element I/496. Next Greater Element I.go
new file mode 100644
index 00000000..b1b9125b
--- /dev/null
+++ b/Algorithms/0496. Next Greater Element I/496. Next Greater Element I.go	
@@ -0,0 +1,25 @@
+package leetcode
+
+func nextGreaterElement(nums1 []int, nums2 []int) []int {
+	if len(nums1) == 0 || len(nums2) == 0 {
+		return []int{}
+	}
+	res, reocrd, flag := []int{}, map[int]int{}, false
+	for i, v := range nums2 {
+		reocrd[v] = i
+	}
+	for i := 0; i < len(nums1); i++ {
+		flag = false
+		for j := reocrd[nums1[i]]; j < len(nums2); j++ {
+			if nums2[j] > nums1[i] {
+				res = append(res, nums2[j])
+				flag = true
+				break
+			}
+		}
+		if flag == false {
+			res = append(res, -1)
+		}
+	}
+	return res
+}
diff --git a/Algorithms/0496. Next Greater Element I/496. Next Greater Element I_test.go b/Algorithms/0496. Next Greater Element I/496. Next Greater Element I_test.go
new file mode 100644
index 00000000..f030ecd3
--- /dev/null
+++ b/Algorithms/0496. Next Greater Element I/496. Next Greater Element I_test.go	
@@ -0,0 +1,50 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+type question496 struct {
+	para496
+	ans496
+}
+
+// para 是参数
+// one 代表第一个参数
+type para496 struct {
+	one     []int
+	another []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans496 struct {
+	one []int
+}
+
+func Test_Problem496(t *testing.T) {
+
+	qs := []question496{
+
+		question496{
+			para496{[]int{4, 1, 2}, []int{1, 3, 4, 2}},
+			ans496{[]int{-1, 3, -1}},
+		},
+
+		question496{
+			para496{[]int{2, 4}, []int{1, 2, 3, 4}},
+			ans496{[]int{3, -1}},
+		},
+
+		// 如需多个测试，可以复制上方元素。
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 496------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans496, q.para496
+		fmt.Printf("【input】:%v       【output】:%v\n", p, nextGreaterElement(p.one, p.another))
+	}
+	fmt.Printf("\n\n\n")
+}
diff --git a/Algorithms/0496. Next Greater Element I/README.md b/Algorithms/0496. Next Greater Element I/README.md
new file mode 100644
index 00000000..a26a7e88
--- /dev/null
+++ b/Algorithms/0496. Next Greater Element I/README.md	
@@ -0,0 +1,44 @@
+# [496. Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/)
+
+## 题目
+
+You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums2.
+
+The Next Greater Number of a number x in nums1 is the first greater number to its right in nums2. If it does not exist, output -1 for this number.
+
+
+Example 1:
+
+```c
+Input: nums1 = [4,1,2], nums2 = [1,3,4,2].
+Output: [-1,3,-1]
+Explanation:
+    For number 4 in the first array, you cannot find the next greater number for it in the second array, so output -1.
+    For number 1 in the first array, the next greater number for it in the second array is 3.
+    For number 2 in the first array, there is no next greater number for it in the second array, so output -1.
+```
+
+Example 2:
+
+```c
+Input: nums1 = [2,4], nums2 = [1,2,3,4].
+Output: [3,-1]
+Explanation:
+    For number 2 in the first array, the next greater number for it in the second array is 3.
+    For number 4 in the first array, there is no next greater number for it in the second array, so output -1.
+```
+
+Note:  
+
+- All elements in nums1 and nums2 are unique.  
+- The length of both nums1 and nums2 would not exceed 1000.
+
+
+## 题目大意
+
+这道题也是简单题。题目给出 2 个数组 A 和 B，针对 A 中的每个数组中的元素，要求在 B 数组中找出比 A 数组中元素大的数，B 中元素之间的顺序保持不变。如果找到了就输出这个值，如果找不到就输出 -1。
+
+
+## 解题思路
+
+简单题，依题意做即可。
\ No newline at end of file