From 369d86734848c08340e533204ac8a695501c38cc Mon Sep 17 00:00:00 2001 From: Yangshun Tay Date: Tue, 17 Oct 2017 18:51:05 +0800 Subject: [PATCH] Update dynamic-programming.md --- algorithms/dynamic-programming.md | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/algorithms/dynamic-programming.md b/algorithms/dynamic-programming.md index a8c43d2b..978fa611 100644 --- a/algorithms/dynamic-programming.md +++ b/algorithms/dynamic-programming.md @@ -1,8 +1,6 @@ Dynamic Programming -=================== +== -Example problems ----------------- - Given a flight itinerary consisting of starting city, destination city, and ticket price (2D list) - find the optimal price flight path to get from start to destination. (A variation of Dynamic Programming Shortest Path) - Given some coin denominations and a target value `M`, return the coins combination with the minimum number of coins. - Time complexity: `O(MN)`, where N is the number of distinct type of coins.