Lunski's Clutter

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

0%

GTD探討怎麼做(How),但過程中會牽扯到很多人,尤其是我們的上司,DISA是(Who)。

Read more »

Objectives and Key Results(OKR)是Google績效考核的一環,我們熟知的Key Performance Indicator(KPI)是上對下,OKR主張讓員工自動自發,這篇文章主要在介紹各種績效標準,這也是我回公司讀的第一本書。

Read more »

Given an integer n. No-Zero integer is a positive integer which doesn’t contain any 0 in its decimal representation.

Return a list of two integers [A, B] where:

A and B are No-Zero integers.
A + B = n
It’s guarateed that there is at least one valid solution. If there are many valid solutions you can return any of them.

Example 1:

1
2
3
Input: n = 2
Output: [1,1]
Explanation: A = 1, B = 1. A + B = n and both A and B don't contain any 0 in their decimal representation.

Example 2:

1
2
Input: n = 11
Output: [2,9]

Example 3:

1
2
Input: n = 10000
Output: [1,9999]

Example 4:

1
2
Input: n = 69
Output: [1,68]

Example 5:

1
2
Input: n = 1010
Output: [11,999]
Read more »

Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]).

Return the running sum of nums.

Example 1:

1
2
3
Input: nums = [1,2,3,4]
Output: [1,3,6,10]
Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].

Example 2:

1
2
3
Input: nums = [1,1,1,1,1]
Output: [1,2,3,4,5]
Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].

Example 3:

1
2
Input: nums = [3,1,2,10,1]
Output: [3,4,6,16,17]
Read more »