摘要：
阅读全文
摘要：
example to explain how to calculate Time Complexity the memo size means each state will be calculated only once how about the TC in each state? class 阅读全文
摘要：
1. Boyer-Moore Voting Algorithm identify the majority element (frequency > n/2) class Solution { public int majorityElement(int[] nums) { int count = 阅读全文
摘要：
1. return it modulo 10^9 + 7 to prevent large result: => int mod = 1_000_000_007; then result %= mod 2. Top-down memorization: memo几维一般看dfs()里面有几个变量+1 阅读全文
摘要：
1. 一般可以用简易版： Arrays.sort(lst, (a,b) -> a[0]-b[0]); 但是在遇到a，b是large numbers时候遇到困难，改成： Arrays.sort(points,(o1,o2)->{ if(o1[1] == o2[1]) return 0; if(o1[1 阅读全文
摘要：
https://blog.developer.atlassian.com/10-design-principles-for-delightful-clis/ 阅读全文
摘要：
1. Intro to Flask 1.1 Simplest Demo 1.1.1 install virtual environment to separate package cd a new folder # see existing packages pip list # venv modu 阅读全文
摘要：
1. Requirement chyper-code.xlsx 2. Implementation 2.1 custom encoding read from excel rename columns uniform type data in excel => dict how to elegant 阅读全文
摘要：
CHAPTER 3: THE ENHANCED E-R MODEL supertype/subtype relationships symbol : or specialization and generalization techniques Note: multivalued composite 阅读全文
摘要：
Add User_Role_Identity function on existing project 1.1 appsettings.json "ConnectionStrings": { "DefaultConnection":"Server=WIN-R68LSH0BM46\\SQLEXPRES 阅读全文