奧數牧人巷
奧數牧人巷
簡介 ABOUT
文字 BLOG
作品 PAST
聯絡 SAY HI
Light
Dark
Automatic
數學 Math
JS | 位元運算 Bitwise Operator
The following is my solution regarding a CodeSignal Problem addTwoDigits 1st Draft (61 Chars) makes use of reduce addTwoDigits=n=> (""+n).split("").reduce((x,y)=> x+Number(y) ,0) 2nd Draft (49 Chars) deploys a recursive skill
Last updated on 2021-08-05
1 min read
JS | 組合算法 Combination Algorithm
This is originally a post in Dev.to A recent CodeSignal Challenge was to calculate 1000C500 (mod 1e9+7) and I got defeated =( All my trials exceeded the time limit.. Here
Last updated on 2021-08-06
1 min read
Cite
×