diff --git "a/docs/DataBase/09Leetcode-Database 351円242円230円350円247円243円.md" "b/docs/DataBase/09Leetcode-Database 351円242円230円350円247円243円.md"
index 4597546..c3d52b5 100644
--- "a/docs/DataBase/09Leetcode-Database 351円242円230円350円247円243円.md"	
+++ "b/docs/DataBase/09Leetcode-Database 351円242円230円350円247円243円.md"	
@@ -284,7 +284,7 @@ HAVING COUNT(id)>= 2;
 
 # *6、删除重复的电子邮箱(196)
 
-https://leetcode.com/problems/delete-duplicate-emails/description/
+[196. 删除重复的电子邮箱](https://leetcode-cn.com/problems/delete-duplicate-emails/)
 
 - 问题描述
 
@@ -356,7 +356,7 @@ WHERE
 
 # 7、组合两个表(175)
 
-https://leetcode.com/problems/combine-two-tables/description/
+[175. 组合两个表](https://leetcode-cn.com/problems/combine-two-tables/)
 
 - 问题描述:
 
@@ -434,7 +434,7 @@ ON p.PersonId=a.PersonId;
 
 # *8、超过经理收入的员工(181)
 
-https://leetcode.com/problems/employees-earning-more-than-their-managers/description/
+[181. 超过经理收入的员工](https://leetcode-cn.com/problems/employees-earning-more-than-their-managers/)
 
 - 问题描述:
 
@@ -504,7 +504,7 @@ FROM
 
 # 9、从不订购的客户(183)
 
-https://leetcode.com/problems/customers-who-never-order/description/
+[181. 超过经理收入的员工](https://leetcode-cn.com/problems/employees-earning-more-than-their-managers/)
 
 - 问题描述:
 
@@ -591,7 +591,7 @@ WHERE
 
 # *10、部门工资最高的员工(184)
 
-https://leetcode.com/problems/department-highest-salary/description/
+[184. 部门工资最高的员工](https://leetcode-cn.com/problems/department-highest-salary/)
 
 - 问题描述:
 
@@ -682,7 +682,7 @@ WHERE
 
 # 11、第二高的薪水(176)
 
-https://leetcode.com/problems/second-highest-salary/description/
+[176. 第二高的薪水](https://leetcode-cn.com/problems/second-highest-salary/)
 
 - 问题描述:
 
@@ -767,7 +767,7 @@ END
 
 # 13、分数排名(178)
 
-https://leetcode.com/problems/rank-scores/description/
+[178. 分数排名](https://leetcode-cn.com/problems/rank-scores/)
 
 - 问题描述:
 
@@ -838,6 +838,8 @@ ORDER BY
 
 # *14、连续出现的数字(180)
 
+[180. 连续出现的数字](https://leetcode-cn.com/problems/consecutive-numbers/)
+
 - 问题描述:
 
 数字表:
@@ -884,9 +886,8 @@ VALUES
 ( 7, 2 );
 ```
 
-- 解题
+- 解题:
 
-- 
 
 ```sql
 # 思路:要求是连续出现 3 次,可使用 3 张该表
@@ -930,7 +931,7 @@ WHERE L1.Num = L2.Num
 
 # 15、换座位(626)(了解)
 
-https://leetcode.com/problems/exchange-seats/description/
+[626. 换座位](https://leetcode-cn.com/problems/exchange-seats/)
 
 - 问题描述:
 
diff --git "a/docs/LeetCode/06351円200円222円345円275円222円345円222円214円345円233円236円346円272円257円346円263円225円.md" "b/docs/LeetCode/06351円200円222円345円275円222円345円222円214円345円233円236円346円272円257円346円263円225円.md"
index 676d5f8..c47219a 100644
--- "a/docs/LeetCode/06351円200円222円345円275円222円345円222円214円345円233円236円346円272円257円346円263円225円.md"
+++ "b/docs/LeetCode/06351円200円222円345円275円222円345円222円214円345円233円236円346円272円257円346円263円225円.md"
@@ -43,7 +43,7 @@ s(digits)是digits所能代表的字母字符串
 letter(digits[i])是digits[i]所能代表的字母
 
 s(digits[0...n-1])
- 
+
 = letter(digits[0]) + s(digits[1...n-1])
 
 = letter(digits[0]) + letter(digits[1]) + s(digits[2...n-1])
@@ -365,7 +365,7 @@ Explanation: The graph looks like this:
 这里面graph是使用的二维数组表示的,[[1,2], [3], [3], []]可以使用矩阵这样表示
 
 
- 
+
 ```java
 private List<list<integer>> res;
 /**
@@ -1719,5 +1719,5 @@ private boolean canPartition(int[] nums,int[] sums,int k,int index,int target){
 return false;
 }
 ```
- 
+
 ## 其他递归问题
\ No newline at end of file
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://github.com/IvanLu1024/Java-Notes/compare/master...th77889900:Java-Notes:master.diff">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://github.com/IvanLu1024/Java-Notes/compare/master...th77889900:Java-Notes:master.diff" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>