feat:modify optimal binary search tree

王海亮 · 王海亮 · commit 35c34c91ccdc · 2019-05-24T17:00:55.000+08:00
diff --git a/doc/Dynamic_Programming/optimal_binary_search_tree.md b/doc/Dynamic_Programming/optimal_binary_search_tree.md
@@ -211,4 +211,4 @@ return e and root;
 
 根据地第三步中得到的root表，可以递推出各个子树的根，从而可以构建出一棵最优二叉查找树。从root[1,n]开始向下递推，一次找出树根，及左子树和右子树。
 
-#### [代码链接](./code/Dynamic_Programming/OptimalBinarySearchTree/optimal_binary_search.java)
+#### [代码链接](../../code/Dynamic_Programming/OptimalBinarySearchTree/optimal_binary_search.java)

Original file line number	Diff line number	Diff line change
`@@ -211,4 +211,4 @@ return e and root;`
`211`	`211`
`212`	`212`	`根据地第三步中得到的root表，可以递推出各个子树的根，从而可以构建出一棵最优二叉查找树。从root[1,n]开始向下递推，一次找出树根，及左子树和右子树。`
`213`	`213`
`214`		`-#### [代码链接](./code/Dynamic_Programming/OptimalBinarySearchTree/optimal_binary_search.java)`
	`214`	`+#### [代码链接](../../code/Dynamic_Programming/OptimalBinarySearchTree/optimal_binary_search.java)`