lockys
diff --git a/‎C++/chapBFS.tex
+3-3 b/‎C++/chapBFS.tex
+3-3
diff --git a/‎C++/chapDivideAndConquer.tex
+1-1 b/‎C++/chapDivideAndConquer.tex
+1-1
@@ -63,7 +63,7 @@ \subsubsection{代码}
 
                     swap(c, new_word[i]);
 
-                    if (dict.count(new_word) > 0 &&
+                    if ((dict.count(new_word) > 0 || new_word == end) &&
                             !visited.count(new_word)) {
                         result.push_back(new_word);
                         visited.insert(new_word);
@@ -171,7 +171,7 @@ \subsubsection{代码}
 
                     swap(c, new_word[i]);
 
-                    if ((dict.count(new_word) > 0|| new_word == end) &&
+                    if ((dict.count(new_word) > 0 || new_word == end) &&
                              !visited.count(new_word)) {
                         result.insert(new_word);
                     }
@@ -586,4 +586,4 @@ \subsubsection{只用一个队列的写法}
         //return 0;
     }
 }
-\end{Codex}
+\end{Codex}
@@ -57,7 +57,7 @@ \subsubsection{分析}
 
 \subsubsection{代码}
 \begin{Code}
-// LeetCode, Longest Substring Without Repeating Characters
+// LeetCode, Sqrt(x)
 // 二分查找
 // 时间复杂度O(logn)，空间复杂度O(1)
 class Solution {
Original file line number	Diff line number	Diff line change
`@@ -63,7 +63,7 @@ \subsubsection{代码}`
`63`	`63`
`64`	`64`	`swap(c, new_word[i]);`
`65`	`65`
`66`		`- if (dict.count(new_word) > 0 &&`
	`66`	`+ if ((dict.count(new_word) > 0 \|\| new_word == end) &&`
`67`	`67`	`!visited.count(new_word)) {`
`68`	`68`	`result.push_back(new_word);`
`69`	`69`	`visited.insert(new_word);`
`@@ -171,7 +171,7 @@ \subsubsection{代码}`
`171`	`171`
`172`	`172`	`swap(c, new_word[i]);`
`173`	`173`
`174`		`- if ((dict.count(new_word) > 0\|\| new_word == end) &&`
	`174`	`+ if ((dict.count(new_word) > 0 \|\| new_word == end) &&`
`175`	`175`	`!visited.count(new_word)) {`
`176`	`176`	`result.insert(new_word);`
`177`	`177`	`}`
`@@ -586,4 +586,4 @@ \subsubsection{只用一个队列的写法}`
`586`	`586`	`//return 0;`
`587`	`587`	`}`
`588`	`588`	`}`
`589`		`-\end{Codex}`
	`589`	`+\end{Codex}`