Mr WordPress on Hello world!
Category Archives: CS Research&Application
1. BITT Principle Brute Force （暴力解法，低效/费空间） Improvement （优化解法，高效/省空间） Time and space complexity （时间/空间复杂度） Test （测试） 2. Array is sorted and may have better performance （3Sum o(n^2) solution) 数组排序过后可能有奇效 3. Test cases are designed on purpose to test the functionality, not … Continue reading
Data Structure in Java ArrayList — Resizable Array Implementation 1.5x resize if necessary GC vs ARC runtime vs compile time https://stackoverflow.com/questions/7874342/what-is-the-difference-between-objective-c-automatic-reference-counting-and-garb Right shift vs Division 1. faster 2. pure integer 3. no intermediate solution overflow issue (safer, avoid stack overflow) … Continue reading
1. Programming, programming, programming Keep brushing up algorithm and data structure problems Summarize the approach and the process to figure out solution 多刷题 多总结（回顾解题思路） 2. Technical Knowledge: Breadth vs Depth Concentrate on one in early stage, then learn about more 职业早期专精一门，之后拓展广度 … Continue reading
1.Inheritance can be defined as the process where one class acquires the properties (methods and fields) of another. With the use of inheritance the information is made manageable in a hierarchical order. 2. If a class inherits a method … Continue reading
1. Array is easy to index specific element with index, it’s easier to calculate the difference between different elements than linked list. 2. LeetCode Trap Rain Water problem: iterate left and right elements for each element in the input array, … Continue reading
1. Slug Routes: slug-routes gives you the ability to use some unique piece of data to represent your records in URLs other than the ID. https://github.com/felixkiss/slug-routes 2. Docker Docker is an open platform for developers and sysadmins to build, … Continue reading