Java structures 上的作业题,,求大神解答~~ 50C

java structures Data strucures for the principled programmer
书上的一个作业题目 求大神解答。一共2题,,。。
Which implementation of the size and isEmpty methods would you use if you had the potential for a million-element list. (Consider the problem of keeping track of the alumni for the University of Michigan.) How would you choose if you had the potential for a million small lists. (Consider the problem of keeping track of the dependents for each of a million income-tax returns.)
图片说明

第二题:
Suppose we read n integers 1, 2, . . . , n from the input, in order. Flipping a coin, we add each new value to either the head or tail of the list. Does this shuffle the data?
图片说明

多谢各位大神~~

1个回答

1、size
2、yes

hdaw001
hdaw001 谢谢你啦~~~ 可以稍微说明一下下吗? 这个好简洁啊。。。不过还是先谢谢你啦
大约 4 年之前 回复
Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
立即提问