题目
526. Beautiful Arrangement
- Difficulty: Middle
- Total Accepted: 31,338
- Total Submissions: 59,005
Leetcode 945. Minimum Increment to Make Array Unique
Leetcode 188. Best Time to Buy and Sell Stock
本题有四个不同难度的版本：
- 121. Best Time to Buy and Sell Stock
- 122. Best Time to Buy and Sell Stock II
- 123. Best Time to Buy and Sell Stock III
- 188. Best Time to Buy and Sell Stock IV
下面分题进行讲解：
121. Best Time to Buy and Sell Stock
- Difficulty: Easy
- Total Accepted: 379.2K
- Total Submissions: 843.6K
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Note that you cannot sell a stock before you buy one.
Leetcode 140. Word Break
题目
本题有两个不同难度的版本：139. Word Break 和 140. Word Break II。
139. Word Break
- Difficulty: Medium
- Total Accepted: 263K
- Total Submissions: 798K
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
Note:
The same word in the dictionary may be reused multiple times in the segmentation.
You may assume the dictionary does not contain duplicate words.
Example 1:
Input: s = "leetcode", wordDict = ["leet", "code"]
Output: true
Explanation: Return true because "leetcode" can be segmented as "leet code".Example 2:
Input: s = "applepenapple", wordDict = ["apple", "pen"]
Output: true
Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
Note that you are allowed to reuse a dictionary word.Example 3:
Input: s = "catsandog", wordDict = ["cats", "dog", "sand", "and", "cat"]
Output: false
