update Global README

SimZhou · Mar 1, 2020 · 1c7b8df · 1c7b8df
1 parent ae141b2
commit 1c7b8df
Show file tree

Hide file tree

Showing 39 changed files with 3,428 additions and 4,502 deletions.
diff --git a/01_NLP_Main_Course/Assignment10/.ipynb_checkpoints/Assignment_10-checkpoint.ipynb b/01_NLP_Main_Course/Assignment10/.ipynb_checkpoints/Assignment_10-checkpoint.ipynb
diff --git a/01_NLP_Main_Course/Assignment10/Assignment_10.ipynb b/01_NLP_Main_Course/Assignment10/Assignment_10.ipynb
diff --git a/01_NLP_Main_Course/Assignment10/class_10.ipynb b/01_NLP_Main_Course/Assignment10/class_10.ipynb
diff --git a/01_NLP_Main_Course/Assignment11/README.md b/01_NLP_Main_Course/Assignment11/README.md
@@ -61,4 +61,3 @@ Best_price(N) = max(P_N, Best_price(N-1) + Best_price(1), Best_price(N-2) + Best
 > 	![](http://latex.codecogs.com/gif.latex?D(i,j)=\min\begin{cases}D(i-1,j)+1\\D(i,j-1)+1\\D(i-1,j-1)+2\quad{if\;{X(i)\;{!=Y(i)}}}\;{else}\;{D(i-1,j-1)}\end{cases})
 
 
-
Original file line number	Diff line number	Diff line change
Expand Up		@@ -61,4 +61,3 @@ Best_price(N) = max(P_N, Best_price(N-1) + Best_price(1), Best_price(N-2) + Best
		> ![](http://latex.codecogs.com/gif.latex?D(i,j)=\min\begin{cases}D(i-1,j)+1\\D(i,j-1)+1\\D(i-1,j-1)+2\quad{if\;{X(i)\;{!=Y(i)}}}\;{else}\;{D(i-1,j-1)}\end{cases})