diff --git a/notes/Leetcode 题解.md b/notes/Leetcode 题解.md
index 8c1fd1f2..89940768 100644
--- a/notes/Leetcode 题解.md	
+++ b/notes/Leetcode 题解.md	
@@ -366,7 +366,7 @@ public int maxProfit(int[] prices) {
 
 双指针主要用于遍历数组，两个指针指向不同的元素，从而协同完成任务。
 
-**有序数组的 Tow Sum** 
+**有序数组的 Two Sum** 
 
 [Leetcode ：167. Two Sum II - Input array is sorted (Easy)](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/)