Difficulty: medium Problem DescriptionEnglish (Number of Smooth Descent Periods of a Stock)You are given an integer array prices representing the daily price history of a stoc

Difficulty: medium Problem DescriptionEnglish (Online Stock Span)Design an algorithm that collects daily price quotes for some stock and returns the span of that stock’s price

Difficulty: hard Problem DescriptionEnglish (IPO)Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like

Difficulty: medium Stock Series:Part 1: LeetCode 121 - Best Time to Buy and Sell StockPart 2: LeetCode 122 - Best Time to Buy and Sell Stock IIPart 3: LeetCode 12

Difficulty: medium Stock Series:Part 1: LeetCode 121 - Best Time to Buy and Sell StockPart 2: LeetCode 122 - Best Time to Buy and Sell Stock IIPart 3: LeetCode 12

Difficulty: hard Stock Series:Part 1: LeetCode 121 - Best Time to Buy and Sell StockPart 2: LeetCode 122 - Best Time to Buy and Sell Stock IIPart 3: LeetCode 123

Difficulty: hard Stock Series:Part 1: LeetCode 121 - Best Time to Buy and Sell StockPart 2: LeetCode 122 - Best Time to Buy and Sell Stock IIPart 3: LeetCode 123

Difficulty: medium Stock Series:Part 1: LeetCode 121 - Best Time to Buy and Sell StockPart 2: LeetCode 122 - Best Time to Buy and Sell Stock IIPart 3: LeetCode 12

Difficulty: easy Stock Series:Part 1: LeetCode 121 - Best Time to Buy and Sell StockPart 2: LeetCode 122 - Best Time to Buy and Sell Stock IIPart 3: LeetCode 123

muduo: https://github.com/chenshuo/muduo 本系列是 《Linux 多线程服务端编程：使用 muduo C++ 网络库》 学习笔记。Part 12: C++ 经验谈 一种特别的 itoa 实现一般实现一般我们想实现 int 转 char*，往往采用下面的形式。