8000 缩小图片 · samuelcs/leetcode@a516425 · GitHub
[go: up one dir, main page]
Skip to content

Commit a516425

Browse files
soulmachinesoulmachine
committed
缩小图片
1 parent 9753b81 commit a516425

File tree

5 files changed

+9
-9
lines changed

5 files changed

+9
-9
lines changed

‎C++/LeetCodet题解(C++版).pdf

-1.29 KB
Binary file not shown.

‎C++/chapBruteforce.tex

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -706,7 +706,7 @@ \subsubsection{描述}
706706
A mapping of digit to letters (just like on the telephone buttons) is given below.
707707

708708
\begin{center}
709-
\includegraphics{phone-keyboard.png}\\
709+
\includegraphics[width=150pt]{phone-keyboard.png}\\
710710
\figcaption{Phone Keyboard}\label{fig:phone-keyboard}
711711
\end{center}
712712

‎C++/chapDFS.tex

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -166,7 +166,7 @@ \subsubsection{描述}
166166
How many possible unique paths are there?
167167

168168
\begin{center}
169-
\includegraphics[width=300pt]{robot-maze.png}\\
169+
\includegraphics[width=200pt]{robot-maze.png}\\
170170
\figcaption{Above is a $3 \times 7$ grid. How many possible unique paths are there?}\label{fig:unique-paths}
171171
\end{center}
172172

@@ -883,12 +883,12 @@ \subsubsection{描述}
883883
You may assume that there will be only one unique solution.
884884

885885
\begin{center}
886-
\includegraphics[width=200pt]{sudoku.png}\\
886+
\includegraphics[width=150pt]{sudoku.png}\\
887887
\figcaption{A sudoku puzzle...}\label{fig:sudoku}
888888
\end{center}
889889

890890
\begin{center}
891-
\includegraphics[width=200pt]{sudoku-solution.png}\\
891+
\includegraphics[width=150pt]{sudoku-solution.png}\\
892892
\figcaption{...and its solution numbers marked in red}\label{fig:sudoku-solution}
893893
\end{center}
894894

‎C++/chapLinearList.tex

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1025,7 +1025,7 @@ \subsubsection{描述}
10251025
The Sudoku board could be partially filled, where empty cells are filled with the character \fn{'.'}.
10261026

10271027
\begin{center}
1028-
\includegraphics[width=200pt]{sudoku.png}\\
1028+
\includegraphics[width=150pt]{sudoku.png}\\
10291029
\figcaption{A partially filled sudoku which is valid}\label{fig:sudoku}
10301030
\end{center}
10311031

@@ -1239,7 +1239,7 @@ \subsubsection{分析}
12391239
如下图，首先沿着副对角线翻转一次，然后沿着水平中线翻转一次。
12401240

12411241
\begin{center}
1242-
\includegraphics{rotate-image.png}\\
1242+
\includegraphics[width=200pt]{rotate-image.png}\\
12431243
\figcaption{Rotate Image}\label{fig:rotate-image}
12441244
\end{center}
12451245

@@ -1471,7 +1471,7 @@ \subsubsection{分析}
14711471
$n$比特的格雷码，可以递归地从$n-1$比特的格雷码生成。如图\S \ref{fig:gray-code-construction}所示。
14721472

14731473
\begin{center}
1474-
\includegraphics{gray-code-construction.png}\\
1474+
\includegraphics[width=160pt]{gray-code-construction.png}\\
14751475
\figcaption{The first few steps of the reflect-and-prefix method.}\label{fig:gray-code-construction}
14761476
\end{center}
14771477

‎C++/chapStackAndQueue.tex

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -161,12 +161,12 @@ \subsubsection{描述}
161161
Given $n$ non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
162162

163163
\begin{center}
164-
\includegraphics{histogram.png}\\
164+
\includegraphics[width=120pt]{histogram.png}\\
165165
\figcaption{Above is a histogram where width of each bar is 1, given height = \fn{[2,1,5,6,2,3]}.}\label{fig:histogram}
166166
\end{center}
167167

168168
\begin{center}
169-
\includegraphics{histogram-area.png}\\
169+
\includegraphics[width=120pt]{histogram-area.png}\\
170170
\figcaption{The largest rectangle is shown in the shaded area, which has area = 10 unit.}\label{fig:histogram-area}
171171
\end{center}
172172

0 commit comments

Comments
 (0)
0