<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Hanwenwangad的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Hanwenwangad</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Hanwenwangad]]></copyright><item><title><![CDATA[Google 面试题 phone interview]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/52343628</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/52343628</guid><author>Hanwenwangad</author><pubDate>Sun, 28 Aug 2016 09:16:26 +0800</pubDate><description><![CDATA[摘自一亩三分地





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%]]></description><category></category></item><item><title><![CDATA[Leetcode 146. LRU Cache]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50670882</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50670882</guid><author>Hanwenwangad</author><pubDate>Tue, 16 Feb 2016 01:21:04 +0800</pubDate><description><![CDATA[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 ]]></description><category></category></item><item><title><![CDATA[DFS + BackTracking]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50662573</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50662573</guid><author>Hanwenwangad</author><pubDate>Sun, 14 Feb 2016 12:00:28 +0800</pubDate><description><![CDATA[这是Leetcode经典系列题，就是考对于DFS的理解，确实有技术含量
想上来Combination上来热一下身，如何回溯。就是加1，减1


然后是Combination sum1


combination sum2 


combination sum3 


然后是Permutation 


permutation2 
http://www.shuati]]></description><category></category></item><item><title><![CDATA[KMP 算法]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50661957</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50661957</guid><author>Hanwenwangad</author><pubDate>Sun, 14 Feb 2016 06:10:52 +0800</pubDate><description><![CDATA[This is a String matching algorithm, to match the target string to a txt string
This is wikidep
http://www.geeksforgeeks.org/searching-for-patterns-set-2-kmp-algorithm/]]></description><category></category></item><item><title><![CDATA[Amazon coding 题解答]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50661082</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50661082</guid><author>Hanwenwangad</author><pubDate>Sun, 14 Feb 2016 00:45:17 +0800</pubDate><description><![CDATA[没有过了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]]></description><category></category></item><item><title><![CDATA[Amazon on compus 面经]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50661027</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50661027</guid><author>Hanwenwangad</author><pubDate>Sun, 14 Feb 2016 00:41:42 +0800</pubDate><description><![CDATA[coding题
circular sorted linked list的插入，backtracking走迷宫，还有内存管理的LUR算法~


这三种题型。


编程题用C++的话，不支持自己写子函数。递归只能自己写Stack.





这里有面经，加油吧，把所有的Case都过了就好了。
http://www.1point3acres.com/bbs/thread-16]]></description><category></category></item><item><title><![CDATA[GeeksforGeeks 统计一个数组中的相反的数的对数]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50644422</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50644422</guid><author>Hanwenwangad</author><pubDate>Mon, 08 Feb 2016 07:33:34 +0800</pubDate><description><![CDATA[原帖在这里使用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.
就是]]></description><category></category></item><item><title><![CDATA[GeeksForGeeks Power(x,n)]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50644419</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50644419</guid><author>Hanwenwangad</author><pubDate>Mon, 08 Feb 2016 07:16:55 +0800</pubDate><description><![CDATA[This is a example to use the divide and conquer


Write a program to calculate pow(x,n)


这里用一个int tem 记录Power(x, n/2),然后将两者相乘得到的结果就可以，所以如果计算Power(x,n)jiu]]></description><category></category></item><item><title><![CDATA[GeeksforGeeks 上关于时间空间复杂度的大O和大zeta分析]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642863</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642863</guid><author>Hanwenwangad</author><pubDate>Sun, 07 Feb 2016 14:21:08 +0800</pubDate><description><![CDATA[传送门：
http://www.geeksforgeeks.org/analysis-of-algorithms-set-3asymptotic-notations/
我觉得大zita是下界
大O是上界]]></description><category></category></item><item><title><![CDATA[geeksforgeeks]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642860</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642860</guid><author>Hanwenwangad</author><pubDate>Sun, 07 Feb 2016 14:16:13 +0800</pubDate><description><![CDATA[这个是对space complexity 的解释
http://www.geeksforgeeks.org/g-fact-86/
我在面试的时候得问清楚这个time complexity算不算input的size
如果算是怎么做，如果不算是怎么做。]]></description><category></category></item><item><title><![CDATA[Geeksforgeeks time complexity]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642859</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642859</guid><author>Hanwenwangad</author><pubDate>Sun, 07 Feb 2016 14:12:23 +0800</pubDate><description><![CDATA[一个time complexity 的问题
http://www.geeksforgeeks.org/a-time-complexity-question/]]></description><category></category></item><item><title><![CDATA[Leetcode 322. Coin Change]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642824</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642824</guid><author>Hanwenwangad</author><pubDate>Sun, 07 Feb 2016 13:49:48 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[Algorithm, Counting sort]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642783</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642783</guid><author>Hanwenwangad</author><pubDate>Sun, 07 Feb 2016 13:02:26 +0800</pubDate><description><![CDATA[维基百科的链接
https://en.wikipedia.org/wiki/Counting_sort


这里是这个数组有一个大小的范围，是有限的范围，所以可以是O(n)的效率]]></description><category></category></item><item><title><![CDATA[基本数据结构-heap实现]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642562</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642562</guid><author>Hanwenwangad</author><pubDate>Sun, 07 Feb 2016 08:04:19 +0800</pubDate><description><![CDATA[//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]]></description><category></category></item><item><title><![CDATA[Amazon面经2016/2]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642545</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50642545</guid><author>Hanwenwangad</author><pubDate>Sun, 07 Feb 2016 07:08:10 +0800</pubDate><description><![CDATA[楼主拖到了二月份才开始完全的热好身准备找实习是在是略SB，要是早点现在估计Offer 都有了吧



Amazon 面经


http://www.1point3acres.com/bbs/thread-167097-1-1.html


之前1月做的，给大家参考一下：
1. 给一个数n，要求打印出长宽为n的直角三角形，比如
    3              A]]></description><category></category></item><item><title><![CDATA[CC150 LinkedList]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50632292</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50632292</guid><author>Hanwenwangad</author><pubDate>Thu, 04 Feb 2016 04:11:44 +0800</pubDate><description><![CDATA[CC150中的LinkedList讲的很好,之后上代码，最近太忙了






2.1 Write code to remove duplicates from an unsorted linked list. 



这道题很简单就是利用HashTable存数然后遇到之前遇到过的节点直接删除

如果No buffer used，就是只能使用O(1) space comp]]></description><category></category></item><item><title><![CDATA[CC150 chapter 8 OOD object-oriented design]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50614162</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50614162</guid><author>Hanwenwangad</author><pubDate>Sun, 31 Jan 2016 11:24:13 +0800</pubDate><description><![CDATA[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.html

I find there are several ]]></description><category></category></item><item><title><![CDATA[Leetcode 91. Decode Ways]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50613915</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50613915</guid><author>Hanwenwangad</author><pubDate>Sun, 31 Jan 2016 09:15:22 +0800</pubDate><description><![CDATA[A message containing letters from A-Z is being encoded to numbers using the following
 mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26


Given an encoded message containing digits, determine the total nu]]></description><category></category></item><item><title><![CDATA[Leetcode 322. Coin Change]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50613879</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50613879</guid><author>Hanwenwangad</author><pubDate>Sun, 31 Jan 2016 07:10:30 +0800</pubDate><description><![CDATA[322. Coin Change
没有AC,思路就是DP
322. Coin Change
public class Solution {
    public int coinChange(int[] coins, int amount) {
        int[] dp = new int[amount + 1];
        for(int i = 1; i <= amount]]></description><category></category></item><item><title><![CDATA[Leetcode bit manipulation 总结]]></title><link>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50613876</link><guid>https://blog.youkuaiyun.com/Hanwenwangad/article/details/50613876</guid><author>Hanwenwangad</author><pubDate>Sun, 31 Jan 2016 06:58:34 +0800</pubDate><description><![CDATA[136. Single Number
利用Xor 求结果
137. Single Number II

统计数字出现的数目，如果是1被整除，这一位是0，如果没有被1整除则这一位是0；
260.
 Single Number III

利用其中的一位数字区别两个数，然后将两个数构成两个集合，这两个集合分别求XOR，得到的结果就是这两位数。
190.
 Reverse Bits]]></description><category></category></item></channel></rss>