cc150
文章平均质量分 54
伊萨卡钢琴家
这个作者很懒,什么都没留下…
展开
-
CC150 16 chapter operating system
There are more fundamental problems in CC150, so it would be good if I can go through the problems in CC150 and go over the basic things on this book. It would definitely help me a lot. The first thin原创 2016-01-30 13:08:37 · 433 阅读 · 0 评论 -
CC150 chapter 8 OOD
Object-oriented design is a very good situation for interviewers to test whether or not the candidates know about coding style well.You can write codes, and it's really difficult to give awesome cod原创 2016-01-30 13:39:45 · 574 阅读 · 0 评论 -
CC150 chapter 1 Arrays and strings.
CC150 chapter 1 总结1HashTable: 实质是Array. 如何实现HashTable 在Java中Here is the way that implments the hash table. A hashtable is a array of listnode. and the time complexity for all the basic operatio原创 2016-01-31 02:44:50 · 354 阅读 · 0 评论 -
CC150 Bit manipulation
The big manipulation problem on CC150 is quite tricky/there are basically fundamental operation like and or and xor. and we can use the bit movement to solve some problems like set get and原创 2016-01-31 03:08:46 · 275 阅读 · 0 评论 -
Leetcode 90. Subsets II
iven a collection of integers that might contain duplicates, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain dup原创 2016-01-31 03:46:44 · 273 阅读 · 0 评论 -
CC150 chapter 8 OOD object-oriented design
OOD is quite difficult, especially for the green programmer like me.When I go to tutorial here http://www.javaworld.com/article/2073352/core-java/simply-singleton.htmlI find there are several原创 2016-01-31 11:24:13 · 1021 阅读 · 0 评论 -
CC150 LinkedList
CC150中的LinkedList讲的很好,之后上代码,最近太忙了2.1 Write code to remove duplicates from an unsorted linked list. 这道题很简单就是利用HashTable存数然后遇到之前遇到过的节点直接删除如果No buffer used,就是只能使用O(1) space comp原创 2016-02-04 04:11:44 · 417 阅读 · 0 评论