From Jon's webpage, which is super good

Savage’s approach to research, via Mosteller:

1. As soon as a problem is stated, start right away to solve it. Use simple examples.
2. Keep starting from first principles, explaining again and again what you are trying to do.
3. Believe that this problem can be solved and that you will enjoy working it out.
4. Don’t be hampered by the original problem statement. Try other problems in its neighborhood; maybe there’s a better problem than yours.
5. Work an hour or so on it frequently.
6. Talk about it; explain it to people.

Quotes worth quoting:

• Good judgment comes from experience. Experience comes from bad judgment. 
  —Jim Horning

• Dealing with failure is easy: work hard to improve. Success is also easy to handle: you’ve solved the wrong problem. Work hard to improve. 
  —Alan J. Perlis

• However beautiful the strategy, you should occasionally look at the results. 
  —Winston Churchill

• I have yet to see any problem, however complicated, which, when looked at in the right way, did not become still more complicated. 
  —Poul Anderson

• The difference between theory and practice: in theory, there’s no difference between theory and practice; in practice, there is. 
  —Jan L. A. van de Snepscheut

• The most exciting phrase to hear in science is not “Eureka!” but “That’s funny...” 
  —Isaac Asimov

• Don’t worry about people stealing your ideas. If your ideas are any good, you’ll have to ram them down people’s throats. 
  —Howard Aiken

• The secret to creativity is knowing how to hide your sources. 
  —Albert Einstein

• Men never do evil so cheerfully and completely as when they do it from religious conviction. 
  —Blaise Pascal

• I was unable to find flaws in my ‘proof’ for quite a while, even though the error is very obvious. It was a psychological problem, a blindness, an excitement, an inhibition of reasoning by an underlying fear of being wrong. Techniques leading to the abandonment of such inhibitions should be cultivated by every honest mathematician. 
  —John R. Stallings Jr. [on his false proof of Poincare’s conjecture]

• For sheer brilliance I could divide all those whom I have taught into two groups: one contained a single outstanding boy, R. A. Fisher; the other all the rest. 
  —Arthur Vassal, Fisher's biology teacher at Harrow

• [Fisher] fitted the classical definition of a gentleman: he never insulted anyone unintentionally. 
  —J.F. Crow

• I occasionally meet geneticists who ask me whether it is true that the great geneticist R. A. Fisher was also an important statistician. 
  —L. J. Savage

• If the topic of regression comes up in a trial, the side that must explain regression to the jury will lose. 
  —David A. Freedman

good

Not so much "life-hacks" but things that have made me successful(ish):

• Exercise really is the solution to so many of life's issues (moods, health, etc.).  It's not just hype.  My entire life has been changed in monumental ways because of exercise.  If you're not getting enough exercise (or unless you are one of the rare like 1% of people who genuinely can be healthy without it) then you are suffering in some way.  It doesn't have to be CrossFit or running marathons, but you should be exercising.
• Make a list of your priorities (including people).  Update it as necessary, but refer to it frequently.  It will help you make decisions on what is important in life.  It's cold.  It's calculating.  But so are you, we all are; we all have priorities (and we hate to admit that we rank people and things, but you do, we all do -- I'm just honest about it and write it down; if you're in my life, you're on the list).  The difference between those who cannot prioritize and those that do is about two heartbeats in making decisions that most people agonize over.
• It's better to do things than to have things.  I'm not rich, but I can do one or the other.  I can afford nice things. I could have all sorts of great shit that people would look at and desire.  I can travel and do things and have great experiences with my husband.  But I can't do both.  Doing things together builds your relationships; having things seems to distract away from what's important.

Okay, and one more:

• If you have plans, have re-evaluation periods and benchmarks.  It's hard.  It ain't fun.  But if you don't have goals and dates that those goals need to meet, then you are unlikely to succeed in a lot of things you try to do.  Your goals should be flexible (mine change all the time), but the ones I have, have evaluation periods that I look back and think, "Why am I doing this?"  If I'm not on track to meet the goals, if I feel like I'm missing the mark (or that it's no longer worth it), I evaluate and change course.

A good way to live life in happy ways: never get happiness by comparing to peers

How does a person cope with depression when he goes on LinkedIn and discovers many of his peers getting ahead with high-sounding job titles while he is still a nobody despite working very hard at his job and is quite good at it?

I think Peggy Li already gave a great answer to this question, so, uh, I just have one additional point to make.

If you allow your level of satisfaction in life to be tied to whether your peers are better than you in one specific aspect of life, you'll never be happy, nor will you have the right mindset to achieve your full potential.

For one thing, there will always be people better than you, and the higher up you get, the more impressive are the peers you encounter. What if you had a "high-sounding job title" too, like your peers? You'd have more responsibility, and probably attend conferences in your field, where you'd meet and network people who are even better than you. Nothing would change. And even if you were literally at the top of your field, you can't be the best at everything. You can always find something else that other people are better at.

But also, for the most part, people don't come to excel through the desire to land in high-up places. They come to excel by working hard at something they enjoy and taking pride in constantly building their skill set and experience.

To me, it's pretty clear that feeling constantly disappointed with oneself is not a good motivator in life---it is not something that will enable you to eventually be happy or to accomplish your goals. It is therefore not something that should be part of a healthy person's life. When people feel the need to compare themselves with others too much, it is usually a symptom of something else missing in their lives. For example, it could be that you feel you aren't appreciated enough by your manager and your co-workers at your existing job, and your rationalization is that you feel bad because your job isn't prestigious enough, but really, that isn't the underlying cause. Some critical reflection would be helpful here---what is missing from your life? (Note: If you really are depressed, do seek therapy, as you won't be able to reason with yourself.)

Wall Street

I watched the documentary <<Wall Street>>  by CCTV on youtube. It is a wonderful series of documentaries. I would like to watch more and learn more.

This gives me more respect to Wall Street. The finance world helps the world to connect innovation and development. We should encourage the development of finance. 

I will take my best to learn how to invest and how to innnovate. 

It really inspire me. I like it. 

Fwd: leetcode难度及面试频率 zz

	1	Two Sum	2	5	array	sort
					set	Two Pointers
	2	Add Two Numbers	3	4	linked list	Two Pointers
						Math
	3	Longest Substring Without Repeating Characters	3	2	string	Two Pointers
					hashtable
	4	Median of Two Sorted Arrays	5	3	array	Binary Search
	5	Longest Palindromic Substring	4	2	string
	6	ZigZag Conversion	3	1	string
	7	Reverse Integer	2	3		Math
	8	String to Integer (atoi)	2	5	string	Math
	9	Palindrome Number	2	2		Math
	10	Regular Expression Matching	5	3	string	Recursion
						DP
	11	Container With Most Water	3	2	array	Two Pointers
	12	Integer to Roman	3	4		Math
	13	Roman to Integer	2	4		Math
	14	Longest Common Prefix	2	1	string
	15	3Sum	3	5	array	Two Pointers
	16	3Sum Closest	3	1	array	Two Pointers
	17	Letter Combinations of a Phone Number	3	3	string	DFS
	18	4Sum	3	2	array
	19	Remove Nth Node From End of List	2	3	linked list	Two Pointers
	20	Valid Parentheses	2	5	string	Stack
	21	Merge Two Sorted Lists	2	5	linked list	sort
						Two Pointers
						merge
	22	Generate Parentheses	3	4	string	DFS
	23	Merge k Sorted Lists	3	4	linked list	sort
					heap	Two Pointers
						merge
	24	Swap Nodes in Pairs	2	4	linked list
	25	Reverse Nodes in k-Group	4	2	linked list	Recursion
						Two Pointers
	26	Remove Duplicates from Sorted Array	1	3	array	Two Pointers
	27	Remove Element	1	4	array	Two Pointers
	28	Implement strStr()	4	5	string	Two Pointers
						KMP
						rolling hash
	29	Divide Two Integers	4	3		Binary Search
						Math
	30	Substring with Concatenation of All Words	3	1	string	Two Pointers
	31	Next Permutation	5	2	array	permutation
	32	Longest Valid Parentheses	4	1	string	DP
	33	Search in Rotated Sorted Array	4	3	array	Binary Search
	34	Search for a Range	4	3	array	Binary Search
	35	Search Insert Position	2	2	array
	36	Valid Sudoku	2	2	array
	37	Sudoku Solver	4	2	array	DFS
	38	Count and Say	2	2	string	Two Pointers
	39	Combination Sum	3	3	array	combination
	40	Combination Sum II	4	2	array	combination
	41	First Missing Positive	5	2	array	sort
	42	Trapping Rain Water	4	2	array	Two Pointers
						Stack
	43	Multiply Strings	4	3	string	Two Pointers
						Math
	44	Wildcard Matching	5	3	string	Recursion
						DP
						greedy
	45	Jump Game II	4	2	array
	46	Permutations	3	4	array	permutation
	47	Permutations II	4	2	array	permutation
	48	Rotate Image	4	2	array
	49	Anagrams	3	4	string
					hashtable
	50	Pow(x, n)	3	5		Binary Search
						Math
	51	N-Queens	4	3	array	DFS
	52	N-Queens II	4	3	array	DFS
	53	Maximum Subarray	3	3	array	DP
	54	Spiral Matrix	4	2	array
	55	Jump Game	3	2	array
	56	Merge Intervals	4	5	array	sort
					linked list	merge
					red-black tree
	57	Insert Interval	4	5	array	sort
					linked list	merge
					red-black tree
	58	Length of Last Word	1	1	string
	59	Spiral Matrix II	3	2	array
	60	Permutation Sequence	5	1		permutation
						Math
	61	Rotate List	3	2	linked list	Two Pointers
	62	Unique Paths	2	3	array	DP
	63	Unique Paths II	3	3	array	DP
	64	Minimum Path Sum	3	3	array	DP
	65	Valid Number	2	5	string	Math
	66	Plus One	1	2	array	Math
	67	Add Binary	2	4	string	Two Pointers
						Math
	68	Text Justification	4	2	string
	69	Sqrt(x)	4	4		Binary Search
	70	Climbing Stairs	2	5		DP
	71	Simplify Path	3	1	string	Stack
	72	Edit Distance	4	3	string	DP
	73	Set Matrix Zeroes	3	5	array
	74	Search a 2D Matrix	3	3	array	Binary Search
	75	Sort Colors	4	2	array	sort
						Two Pointers
	76	Minimum Window Substring	4	2	string	Two Pointers
	77	Combinations	3	4		combination
	78	Subsets	3	4	array	Recursion
						combination
	79	Word Search	3	4	array	DFS
	80	Remove Duplicates from Sorted Array II	2	2	array	Two Pointers
	81	Search in Rotated Sorted Array II	5	3	array	Binary Search
	82	Remove Duplicates from Sorted List II	3	3	linked list	Recursion
						Two Pointers
	83	Remove Duplicates from Sorted List	1	3	linked list
	84	Largest Rectangle in Histogram	5	2	array	Stack
	85	Maximal Rectangle	5	1	array	DP
						Stack
	86	Partition List	3	3	linked list	Two Pointers
	87	Scramble String	5	2	string	Recursion
						DP
	88	Merge Sorted Array	2	5	array	Two Pointers
						merge
	89	Gray Code	4	2		combination
	90	Subsets II	4	2	array	Recursion
						combination
	91	Decode Ways	3	4	string	Recursion
						DP
	92	Reverse Linked List II	3	2	linked list	Two Pointers
	93	Restore IP Addresses	3	3	string	DFS
	94	Binary Tree Inorder Traversal	4	3	tree	Recursion
					hashtable	morris
						Stack
	95	Unique Binary Search Trees II	4	1	tree	DP
						DFS
	96	Unique Binary Search Trees	3	1	tree	DP
	97	Interleaving String	5	2	string	Recursion
						DP
	98	Validate Binary Search Tree	3	5	tree	DFS
	99	Recover Binary Search Tree	4	2	tree	DFS
	100	Same Tree	1	1	tree	DFS
	101	Symmetric Tree	1	2	tree	DFS
	102	Binary Tree Level Order Traversal	3	4	tree	BFS
	103	Binary Tree Zigzag Level Order Traversal	4	3	queue	BFS
					tree	Stack
	104	Maximum Depth of Binary Tree	1	1	tree	DFS
	105	Construct Binary Tree from Preorder and Inorder Tr	3	3	array	DFS
					tree
	106	Construct Binary Tree from Inorder and Postorder T	3	3	array	DFS
					tree
	107	Binary Tree Level Order Traversal II	3	1	tree	BFS
	108	Convert Sorted Array to Binary Search Tree	2	3	tree	DFS
	109	Convert Sorted List to Binary Search Tree	4	3	linked list	Recursion
						Two Pointers
	110	Balanced Binary Tree	1	2	tree	DFS
	111	Minimum Depth of Binary Tree	1	1	tree	DFS
	112	Path Sum	1	3	tree	DFS
	113	Path Sum II	2	2	tree	DFS
	114	Flatten Binary Tree to Linked List	3	3	tree	Recursion
						Stack
	115	Distinct Subsequences	4	2	string	DP
	116	Populating Next Right Pointers in Each Node	3	3	tree	DFS
	117	Populating Next Right Pointers in Each Node II	4	2	tree	DFS
	118	Pascal's Triangle	2	1	array
	119	Pascal's Triangle II	2	1	array
	120	Triangle	3	1	array	DP
	121	Best Time to Buy and Sell Stock	2	1	array	DP
	122	Best Time to Buy and Sell Stock II	3	1	array	greedy
	123	Best Time to Buy and Sell Stock III	4	1	array	DP
	124	Binary Tree Maximum Path Sum	4	2	tree	DFS
	125	Valid Palindrome	2	5	string	Two Pointers
	126	Word Ladder II	1	1
	127	Word Ladder	3	5	graph	BFS
						shortest path
	128	Longest Consecutive Sequence	4	3	array
	129	Sum Root to Leaf Numbers	2	4	tree	DFS
	130	Surrounded Regions	4	3	array	BFS
						DFS
	131	Palindrome Partitioning	3	4	string	DFS
	132	Palindrome Partitioning II	4	3	string	DP

• 上一篇面试准备汇总
• 下一篇如何做cc150算法题