[問題] 資結-問一題huffmen
請教一下
What is an optimal Huffman code for the following set of frequencies, based
on the first 8 Fibonacci numbers?
a:1 b:1 c:2 d:3 e:5 f:8 g:13 h:21
Can you generalize your answer to find the optimal code when the
frequencies are the first n Fibonacci numbers?
請教一下,最後兩行說的是什麼意思呢?
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.228.99.110
推
04/25 23:00, , 1F
04/25 23:00, 1F
推
04/26 00:15, , 2F
04/26 00:15, 2F
→
04/26 00:16, , 3F
04/26 00:16, 3F
→
04/26 04:28, , 4F
04/26 04:28, 4F
→
04/26 04:28, , 5F
04/26 04:28, 5F
推
04/26 14:01, , 6F
04/26 14:01, 6F
→
04/26 14:01, , 7F
04/26 14:01, 7F
→
04/26 14:04, , 8F
04/26 14:04, 8F
推
04/26 15:57, , 9F
04/26 15:57, 9F
推
04/26 15:57, , 10F
04/26 15:57, 10F
→
04/26 15:59, , 11F
04/26 15:59, 11F
→
04/26 16:00, , 12F
04/26 16:00, 12F
→
04/26 17:42, , 13F
04/26 17:42, 13F