214

wind-liang · wind-liang · commit 2b780cd3f73c · 2020-01-27T23:28:49.000+08:00
diff --git a/SUMMARY.md b/SUMMARY.md
@@ -193,4 +193,5 @@
     * [211. Add and Search Word - Data structure design](leetcode-211-Add-And-Search-Word-Data-structure-design.md)
     * [212. Word Search II](leetcode-212-Word-SearchII.md)
     * [213. House Robber II](leetcode-213-House-RobberII.md)
+    * [214*. Shortest Palindrome](leetcode-214-Shortest-Palindrome.md)
     * [更多](more.md)
diff --git a/leetCode-23-Merge-k-Sorted-Lists.md b/leetCode-23-Merge-k-Sorted-Lists.md
@@ -261,7 +261,7 @@ public ListNode mergeKLists(ListNode[] lists) {
 }
 ```
 
-时间复杂度：假设每个链表的长度都是 n ，那么时间复杂度就是$$O(\sum_{i=1}^{log_2k}n)=O(nlogk)$$。
+时间复杂度：假设每个链表的长度都是 `n` ，有 `k` 个链表，记总结点数是 `N = n * k`，那么时间复杂度就是$$O(\sum_{i=1}^{log_2k}N)=O(Nlogk)$$。
 
 空间复杂度：O（1）。
 
diff --git a/leetCode-45-Jump-Game-II.md b/leetCode-45-Jump-Game-II.md
@@ -85,5 +85,3 @@ public int jump(int[] nums) {
 # 总
 
 刷这么多题，第一次遇到了贪心算法，每次找局部最优，最后达到全局最优，完美！
-
-`
diff --git a/leetcode-201-300.md b/leetcode-201-300.md
@@ -24,4 +24,6 @@
 
 <a href="leetcode-212-Word-SearchII.html">212. Word Search II</a>
 
-<a href="leetcode-213-House-RobberII.html">213. House Robber II</a>
+<a href="leetcode-213-House-RobberII.html">213. House Robber II</a>
+
+<a href="leetcode-214-Shortest-Palindrome.html">214. Shortest Palindrome</a>
diff --git a/leetcode-214-Shortest-Palindrome.md b/leetcode-214-Shortest-Palindrome.md

Original file line number	Diff line number	Diff line change
`@@ -261,7 +261,7 @@ public ListNode mergeKLists(ListNode[] lists) {`
`261`	`261`	`}`
`262`	`262`	```
`263`	`263`
`264`		`-时间复杂度：假设每个链表的长度都是 n ，那么时间复杂度就是$$O(\sum_{i=1}^{log_2k}n)=O(nlogk)$$。`
	`264`	+时间复杂度：假设每个链表的长度都是 `n` ，有 `k` 个链表，记总结点数是 `N = n * k`，那么时间复杂度就是$$O(\sum_{i=1}^{log_2k}N)=O(Nlogk)$$。
`265`	`265`
`266`	`266`	`空间复杂度：O（1）。`
`267`	`267`
-Original file line number
+Diff line change
 # 总
 刷这么多题，第一次遇到了贪心算法，每次找局部最优，最后达到全局最优，完美！
+-
 -`