In my project I checked out to another branch and then everything is fine, so I want to merge it and *overwrite the master branch. And I found the same problem in bitbucket, and I just copied
git merge master --strategy=ours
But, this is to overwrite my current branch …
read more在知乎上看到了关于这部纪录片的帖子，感觉非常的神奇，于是就在Youtube上找到了这部片子的链接，凑合着看了下来。现在的英语看看纪录片还可以，看 …
read more最近过的比较堕落，代码实在调不出来，又因为有同学说我长得像《琅琊榜》中的某个人物，一时兴起之下，在Youtube上看了起来。不得不说这部 …
read more最近找工作好没有头绪，眼看着还有两个半月就要毕业，还不知道下一站在哪里，仔细算算，办工作签证也要至少一个月的 …
read moreBalanced trees are wildly used but rarely asked during the job interview due to the complexity to implement them. However we still need to have a basic understanding of them.
Two most popular balanced trees are:
Red Black Tree: Reference for Red Black Tree.
AVL Tree: Reference for AVL Tree …
Interval trees and segment trees are two popular but not-so-popular data structure and they may be asked during job interview. The key difference between interval trees and segments is the first one faces intervals while the second one deals with points.
Interval Tree: Reference from G4G. Note that we assume …
I once thought questions like 'which part is the const variables stored in memory' was not good because we could quickly search the manual when necessary, however they are asked during the job interview, and asked twice!
So, let's just take a brief look at the frequent asked C++ interview …
read moreI was once asked the question how to optimize a linked list? Well, I'm not sure... So long as the linked list is somehow a linear data structure, we can only visit the previous elements to get the successive elements. I would try to build a BST instead, or maintain …
read more
