chore:

kimi0230 · Mar 24, 2024 · a5ee629 · a5ee629
1 parent ad7e095
commit a5ee629
Show file tree

Hide file tree

Showing 3 changed files with 7 additions and 5 deletions.
diff --git a/Leetcode/0128.Longest-Consecutive-Sequence/README.md b/Leetcode/0128.Longest-Consecutive-Sequence/README.md
@@ -10,7 +10,7 @@ description: "0128.Longest-Consecutive-Sequence"
 license: ""
 images: []
 
-tags: [LeetCode, Go, Medium, Longest Consecutive Sequence, Array, Hash Table, Union Find]
+tags: [LeetCode, Go, Medium, Longest Consecutive Sequence, Array, Hash Table, Union Find, Amazon, Microsoft, Google, Adobe, Spotify]
 categories: [LeetCode]
 
 featuredImage: ""
@@ -62,8 +62,10 @@ seo:
 
 ## 題目
 
-## 題目大意
+給定一個未排序的整數數位列 nums ，找出數字連續的最長序列（不要求序列元素在原陣列中連續）的長度。
+請你設計並實現時間複雜度為 O(n) 的演演算法解決此問題。
 
+## 題目大意
 
 ## 解題思路
 

diff --git a/Leetcode/0128.Longest-Consecutive-Sequence/main.go b/Leetcode/0128.Longest-Consecutive-Sequence/main.go
@@ -1,14 +1,14 @@
 package longestconsecutivesequence
 
-// 時間複雜 O(), 空間複雜 O()
+// 時間複雜 O(n), 空間複雜 O(n)
 func longestConsecutive(nums []int) int {
 	m := make(map[int]struct{}, len(nums))
 	for _, num := range nums {
 		m[num] = struct{}{}
 	}
 	result := 0
 	for v := range m {
-		// 如果沒找到該數字的前一個數字, 則把該數字刀做連續序列的第一個數
+		// 如果沒找到該數字的前一個數字, 則把該數字當做連續序列的第一個數
 		if _, ok := m[v-1]; !ok {
 			length := 1
 			for _, exit := m[v+length]; exit; _, exit = m[v+length] {

diff --git a/Leetcode/0167.Two-Sum-II-Input-Array-Is-Sorted/README.md b/Leetcode/0167.Two-Sum-II-Input-Array-Is-Sorted/README.md
@@ -10,7 +10,7 @@ description: "0167.Two-Sum-II-Input-Array-Is-Sorted"
 license: ""
 images: []
 
-tags: [LeetCode, Go, Medium, Two Sum II Input Array Is Sorted]
+tags: [LeetCode, Go, Medium, Two Sum II Input Array Is Sorted, Array, Two Pointers, Binary Search]
 categories: [LeetCode]
 
 featuredImage: ""