From a9c96a86e5cd04944c598da215fef123c58a06a1 Mon Sep 17 00:00:00 2001 From: Wonderxie Date: Wed, 18 Mar 2020 09:00:49 +0100 Subject: [PATCH] Update README.md and SUMMARY.md --- README.md | 2 +- SUMMARY.md | 2 +- ...me to Buy and Sell Stock.md => BestTimeToBuyAndSellStock.md} | 0 3 files changed, 2 insertions(+), 2 deletions(-) rename dynamic_programming/{Best Time to Buy and Sell Stock.md => BestTimeToBuyAndSellStock.md} (100%) diff --git a/README.md b/README.md index d1012d4..55ef3b7 100644 --- a/README.md +++ b/README.md @@ -30,7 +30,7 @@ This command specifies the `english` branch and limit the depth of clone, get ri * [Longest Increasing Subsequence](dynamic_programming/LongestIncreasingSubsequence.md) * [KMP Algorithm In Detail](dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md) * [House Robber Problems](dynamic_programming/HouseRobber.md) - * [团灭 LeetCode 股票买卖问题](dynamic_programming/团灭股票问题.md) + * [Stock Buy and Sell Problems](dynamic_programming/BestTimeToBuyAndSellStock.md) * II. Data Structure * [Binary Head and Priority Queue](data_structure/binary_heap_implements_priority_queues.md) diff --git a/SUMMARY.md b/SUMMARY.md index 8271d7b..e7b62ee 100644 --- a/SUMMARY.md +++ b/SUMMARY.md @@ -17,7 +17,7 @@ * [Longest Increasing Subsequence](dynamic_programming/LongestIncreasingSubsequence.md) * [KMP Algorithm In Detail](dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md) * [House Robber Problems](dynamic_programming/HouseRobber.md) - * [团灭 LeetCode 股票买卖问题](dynamic_programming/团灭股票问题.md) + * [Stock Buy and Sell Problems](dynamic_programming/BestTimeToBuyAndSellStock.md) * II. Data Structure * [Binary Head and Priority Queue](data_structure/binary_heap_implements_priority_queues.md) diff --git a/dynamic_programming/Best Time to Buy and Sell Stock.md b/dynamic_programming/BestTimeToBuyAndSellStock.md similarity index 100% rename from dynamic_programming/Best Time to Buy and Sell Stock.md rename to dynamic_programming/BestTimeToBuyAndSellStock.md -- GitLab