Hanwenwangad的专栏

摘自一亩三分地http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=200350&extra=page%3D1%26filter%3Dsortid%26sortid%3D311%26searchoption%5B3086%5D%5Bvalue%5D%3D6%26searchoption%5B3086%5D%

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if

这是Leetcode经典系列题，就是考对于DFS的理解，确实有技术含量想上来Combination上来热一下身，如何回溯。就是加1，减1然后是Combination sum1combination sum2 combination sum3 然后是Permutation permutation2 http://www.shuati

This is a String matching algorithm, to match the target string to a txt stringThis is wikidephttp://www.geeksforgeeks.org/searching-for-patterns-set-2-kmp-algorithm/

没有过了test，之后回来跟新1 LRU/**Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will

coding题circular sorted linked list的插入，backtracking走迷宫，还有内存管理的LUR算法~这三种题型。编程题用C++的话，不支持自己写子函数。递归只能自己写Stack.这里有面经，加油吧，把所有的Case都过了就好了。http://www.1point3acres.com/bbs/thread-16

原帖在这里使用merge sort的方法naive 的方法是O(n2)可以利用merge sort提升到O(nlogn)http://www.geeksforgeeks.org/counting-inversions/This is to counting the inversion of the pairs in a array of integer.就是

This is a example to use the divide and conquerWrite a program to calculate pow(x,n)这里用一个int tem 记录Power(x, n/2),然后将两者相乘得到的结果就可以，所以如果计算Power(x,n)jiu

传送门：http://www.geeksforgeeks.org/analysis-of-algorithms-set-3asymptotic-notations/我觉得大zita是下界大O是上界

这个是对space complexity 的解释http://www.geeksforgeeks.org/g-fact-86/我在面试的时候得问清楚这个time complexity算不算input的size如果算是怎么做，如果不算是怎么做。

一个time complexity 的问题http://www.geeksforgeeks.org/a-time-complexity-question/

You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money

维基百科的链接https://en.wikipedia.org/wiki/Counting_sort这里是这个数组有一个大小的范围，是有限的范围，所以可以是O(n)的效率

//This is to implment the heap structure.public class heap{ int[] array; //This is to record the position now we should add the element to int currPosition = 1; //the length of the heap int

楼主拖到了二月份才开始完全的热好身准备找实习是在是略SB，要是早点现在估计Offer 都有了吧Amazon 面经http://www.1point3acres.com/bbs/thread-167097-1-1.html之前1月做的，给大家参考一下：1. 给一个数n，要求打印出长宽为n的直角三角形，比如    3              A

CC150中的LinkedList讲的很好,之后上代码，最近太忙了2.1 Write code to remove duplicates from an unsorted linked list. 这道题很简单就是利用HashTable存数然后遇到之前遇到过的节点直接删除如果No buffer used，就是只能使用O(1) space comp

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

A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total nu

322. Coin Change没有AC,思路就是DP322. Coin Changepublic class Solution { public int coinChange(int[] coins, int amount) { int[] dp = new int[amount + 1]; for(int i = 1; i <= amount

136. Single Number利用Xor 求结果137. Single Number II统计数字出现的数目，如果是1被整除，这一位是0，如果没有被1整除则这一位是0；260. Single Number III利用其中的一位数字区别两个数，然后将两个数构成两个集合，这两个集合分别求XOR，得到的结果就是这两位数。190. Reverse Bits