From f8fe7f7ef6757ab5bce7198e4550976d0d71ca19 Mon Sep 17 00:00:00 2001
From: ParkMoonJ <parkmoonj.9911@gmail.com>
Date: Thu, 8 Apr 2021 21:07:08 +0800
Subject: [PATCH] =?UTF-8?q?Update=203=20=E6=A0=88=E5=92=8C=E9=98=9F?=
 =?UTF-8?q?=E5=88=97.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 3 栈和队列/3 栈和队列.md | 13 ++-----------
 1 file changed, 2 insertions(+), 11 deletions(-)

diff --git a/3 栈和队列/3 栈和队列.md b/3 栈和队列/3 栈和队列.md
index 7320f94..828f7dc 100644
--- a/3 栈和队列/3 栈和队列.md	
+++ b/3 栈和队列/3 栈和队列.md	
@@ -372,11 +372,7 @@ int function(int n) {
 ### 3.26 求解平方根 $\sqrt{A}$ 的迭代函数定义如下：
 
 $$
-sqrt(A, p, e) =
-\begin{cases}
-p & |p^2 - A| < e \\
-sqrt(A, \frac{1}{2}(p + \frac{A}{p}), e) & |p^2 - A| \ge e
-\end{cases}
+sqrt(A, p, e) = \begin{cases} p & |p^2 - A| < e \\ sqrt(A, \frac{1}{2}(p + \frac{A}{p}), e) & |p^2 - A| \ge e \end{cases}
 $$
 
 ### 其中，$p$ 是 $A$ 的近似平方根，$e$ 是结果允许误差。试写出相应的递归算法，并消除递归。
@@ -403,12 +399,7 @@ int function(int A, int p, int e) {
 ### 3.27 已知 Ackerman 函数的定义如下：
 
 $$
-akm(m, n) =
-\begin{cases}
-n + 1 & m = 0 \\
-akm(m - 1, 1) & m \ne 0，n = 0 \\
-akm(m - 1, akm(m, n - 1)) & m \ne 0，n \ne 0
-\end{cases}
+akm(m, n) = \begin{cases} n + 1 & m = 0 \\ akm(m - 1, 1) & m \ne 0，n = 0 \\ akm(m - 1, akm(m, n - 1)) & m \ne 0，n \ne 0 \end{cases}
 $$
 
 #### （1）写出递归算法；