Lunski's Clutter

This is a place to put my clutters, no matter you like it or not, welcome here.

0%

Posted on Edited on In
Symbols count in article: 347 Reading time ≈ 1 mins.

原子習慣再搭配刻意練習就是堅持每天進步一點點

Read more »

Posted on Edited on In
Symbols count in article: 170 Reading time ≈ 1 mins.

機會存在混亂與逆境中
刻意製造混亂讓自己成長
走錯了也沒關係，說不定是另一條正確的路

Read more »

Posted on In
Symbols count in article: 201 Reading time ≈ 1 mins.

In Pascal’s triangle, each number is the sum of the two numbers directly above it.

Example:

1
2
3
4
5
6
7
8
9
Input: 5
Output:
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]
Read more »

Posted on Edited on In
Symbols count in article: 1.2k Reading time ≈ 1 mins.

Say you have an array prices for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

1
2
3
4
Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:

1
2
3
4
5
Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

1
2
3
Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.
Read more »