Princeton Algorithms: Part 1 [week 2:Stacks and Queues]

最新推荐文章于 2020-07-10 20:40:56 发布

Felven

最新推荐文章于 2020-07-10 20:40:56 发布

阅读量1.4k

点赞数

分类专栏： Algorithm 文章标签：算法堆栈队列公开课

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.csdn.net/zhaoxinfan/article/details/35786495

版权

Algorithm 专栏收录该内容

50 篇文章 1 订阅

订阅专栏

Exercises

Explanation：

A correct answer matches the regular expression: \s*~?\s*72\s*N\s*
For example, the following is a correct answer: ~ 72N
Below is a detailed accounting:

public class GenericMysteryBox<Item> {        //       16 (object overhead)
    private Node first;                       //        8 (reference)

    private class Node {                      //       16 (object overhead)
                                              //        8 (inner class overhead)
        private Item item;                    //        8 (reference to Double)
                                              //       24 (Double)
        private Node next;                    //        8 (reference)
        private Node prev;                    //        8 (reference)
    }                                             -------
                                                 24 + 72N
    ...
}