[理工] [ALGO] 101 中央資工
1.
兩個array X , Y , 求 |Xi - Yj| is minimun
time 要比 O(n^2)好
2.
一個array 和 key k 用 time = O(n) , space = O(1)
讓K擺在適當位置,K左邊 < K , K右邊 > K
himt:quick sort
這題我有點不懂,題目好像沒說array中有沒有包含K
K有沒有重複
--
When we toss a coin , we obtain either head or tail. Now we toss a coin 5
times. There are 2^5 possible outcomes. How many of them contain no two
consecutive heads?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 59.105.81.17
※ 編輯: bjk 來自: 59.105.81.17 (02/13 17:33)
→
02/13 17:35, , 1F
02/13 17:35, 1F
→
02/13 17:36, , 2F
02/13 17:36, 2F
→
02/13 17:37, , 3F
02/13 17:37, 3F
→
02/13 17:38, , 4F
02/13 17:38, 4F
→
02/13 17:51, , 5F
02/13 17:51, 5F
→
02/13 17:52, , 6F
02/13 17:52, 6F
推
02/13 18:00, , 7F
02/13 18:00, 7F
推
02/13 18:55, , 8F
02/13 18:55, 8F
→
02/13 18:56, , 9F
02/13 18:56, 9F
推
02/13 19:06, , 10F
02/13 19:06, 10F
→
02/13 19:07, , 11F
02/13 19:07, 11F
→
02/13 19:08, , 12F
02/13 19:08, 12F
→
02/13 19:09, , 13F
02/13 19:09, 13F
→
02/13 19:09, , 14F
02/13 19:09, 14F
→
02/13 19:11, , 15F
02/13 19:11, 15F
推
02/13 19:29, , 16F
02/13 19:29, 16F
推
02/13 22:47, , 17F
02/13 22:47, 17F
推
02/14 00:13, , 18F
02/14 00:13, 18F
推
02/14 00:40, , 19F
02/14 00:40, 19F
→
02/14 00:41, , 20F
02/14 00:41, 20F
→
02/14 00:41, , 21F
02/14 00:41, 21F
→
02/14 00:42, , 22F
02/14 00:42, 22F
→
02/14 00:43, , 23F
02/14 00:43, 23F
→
02/14 00:43, , 24F
02/14 00:43, 24F
→
02/14 00:44, , 25F
02/14 00:44, 25F
→
09/11 14:55, , 26F
09/11 14:55, 26F