<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a33b33C33的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a33b33C33</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a33b33C33]]></copyright><item><title><![CDATA[LFU cache Java]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/52013279</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/52013279</guid><author>a33b33C33</author><pubDate>Sun, 24 Jul 2016 11:53:36 +0800</pubDate><description><![CDATA[public class LFUCache {
    HashMap hashtable = new HashMap();
    int column;
    PriorityQueue priorityQueue;
    
    public LFUCache(int capacity) {
        column = capacity;
        KeyVa]]></description><category></category></item><item><title><![CDATA[leetcode: Word Pattern]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/49063147</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/49063147</guid><author>a33b33C33</author><pubDate>Mon, 12 Oct 2015 03:11:09 +0800</pubDate><description><![CDATA[Given a pattern and a string str,
 find if str follows the same pattern.

Here follow means a full match, such that there is a bijection between a letter in pattern and
 a non-empty word in str.
]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day79:Rectangle Area]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/47103787</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/47103787</guid><author>a33b33C33</author><pubDate>Tue, 28 Jul 2015 13:00:33 +0800</pubDate><description><![CDATA[Find the total area covered by two rectilinear rectangles in a 2D plane.

Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.



Assume that the tota]]></description><category></category></item><item><title><![CDATA[测试server是否block port或者网站]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/47096465</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/47096465</guid><author>a33b33C33</author><pubDate>Tue, 28 Jul 2015 03:40:19 +0800</pubDate><description><![CDATA[网站：
paping apitest.authorize.net -p 443
or ping api.test.authorize.net


SMTP port 25 blocked or not
telnet my-domain-name.com 25]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day78:Binary Search Tree Iterator]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/47083205</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/47083205</guid><author>a33b33C33</author><pubDate>Mon, 27 Jul 2015 12:21:44 +0800</pubDate><description><![CDATA[Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

Calling next() will return the next smallest number in the BST.

Note: next()]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day78:Lowest Common Ancestor of a Binary Tree]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/47082765</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/47082765</guid><author>a33b33C33</author><pubDate>Mon, 27 Jul 2015 11:37:26 +0800</pubDate><description><![CDATA[Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined
 between two node]]></description><category></category></item><item><title><![CDATA[在windows server 2008 R2上运行disk cleanup]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/47033267</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/47033267</guid><author>a33b33C33</author><pubDate>Fri, 24 Jul 2015 02:17:25 +0800</pubDate><description><![CDATA[通常情况下可以在开始-〉Accessories->system tools 里直接找到Disk cleanup
但是在windows server 2008 R2里， 找不到。


为了可以使用cleanmgr， 需要复制两个文件：cleanmgr.exe， cleanmgr.exe.mui


不同的服务器，会在不同的文件夹下找到：






Operating S]]></description><category></category></item><item><title><![CDATA[读书笔记 day1：The design of approximation algorithms]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/47014177</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/47014177</guid><author>a33b33C33</author><pubDate>Thu, 23 Jul 2015 05:53:58 +0800</pubDate><description><![CDATA[Chapter 1


As P not equal to NP, we cannot simultaneously have algorithms that 1. find optimal solutions; 2. in polynomial time; 3. for any instance.
At least one of these requirements need to be]]></description><category></category></item><item><title><![CDATA[Bug record1: The underlying connection was closed: The connection was closed unexpectedly.Then]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/47013067</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/47013067</guid><author>a33b33C33</author><pubDate>Thu, 23 Jul 2015 00:33:28 +0800</pubDate><description><![CDATA[Description:
Setting up a c# console form for testing another web service called api.svc.
After running the web service and make sure it is running correctly, we create the service reference inside ]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day72: Binary Tree Preorder Traversal]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46965163</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46965163</guid><author>a33b33C33</author><pubDate>Mon, 20 Jul 2015 10:40:49 +0800</pubDate><description><![CDATA[Given a binary tree, return the preorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3




return [1,2,3].

Note: Recursive soluti]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day72:Binary Tree Postorder Traversal]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46965027</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46965027</guid><author>a33b33C33</author><pubDate>Mon, 20 Jul 2015 10:33:46 +0800</pubDate><description><![CDATA[Given a binary tree, return the postorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3




return [3,2,1].

Note: Recursive solut]]></description><category></category></item><item><title><![CDATA[开始刷leedtcode day72:Product of Array Except Self]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46964417</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46964417</guid><author>a33b33C33</author><pubDate>Mon, 20 Jul 2015 09:57:42 +0800</pubDate><description><![CDATA[Given an array of n integers where n > 1, nums,
 return an array output such that output[i] is
 equal to the product of all the elements of nums except nums[i].

Solve it without division and in O]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day72: Kth Smallest Element in a BST]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46963807</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46963807</guid><author>a33b33C33</author><pubDate>Mon, 20 Jul 2015 09:14:53 +0800</pubDate><description><![CDATA[Given a binary search tree, write a function kthSmallest to find the kth
 smallest element in it.

Note: 
You may assume k is always valid, 1 ≤ k ≤ BST's total elements.

Follow up:
What if the]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day71:Delete Node in a Linked List]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46953135</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46953135</guid><author>a33b33C33</author><pubDate>Sun, 19 Jul 2015 10:48:42 +0800</pubDate><description><![CDATA[Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Supposed the linked list is 1 -> 2
 -> 3 -> 4 and you are given the third node with value]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day71:Summary Ranges]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46953081</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46953081</guid><author>a33b33C33</author><pubDate>Sun, 19 Jul 2015 10:43:03 +0800</pubDate><description><![CDATA[Given a sorted integer array without duplicates, return the summary of its ranges.

For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].

Credits:
Special thanks to @jianchao.li.fighter ]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day71: Power of Two]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46952859</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46952859</guid><author>a33b33C33</author><pubDate>Sun, 19 Jul 2015 10:09:56 +0800</pubDate><description><![CDATA[Given an integer, write a function to determine if it is a power of two.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.



Java：
public c]]></description><category></category></item><item><title><![CDATA[funny makeup story]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46936565</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46936565</guid><author>a33b33C33</author><pubDate>Sat, 18 Jul 2015 02:31:45 +0800</pubDate><description><![CDATA[Yun's Post Apocalyptic Blog Entry 1: 


Day 1 Hour 1: 


It's lonely in here. I didn't think the apocalypse would come in the form of coffee zombies. I have my trusty PS Vita and the monitor arm]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day63:House Robber II]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46857545</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46857545</guid><author>a33b33C33</author><pubDate>Mon, 13 Jul 2015 06:42:12 +0800</pubDate><description><![CDATA[Note: This is an extension of House
 Robber.
After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day63:Contains Duplicate III]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46857463</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46857463</guid><author>a33b33C33</author><pubDate>Mon, 13 Jul 2015 06:04:55 +0800</pubDate><description><![CDATA[Given an array of integers, find out whether there are two distinct indices i and j in
 the array such that the difference between nums[i] and nums[j] is
 at most t and
 the difference between i an]]></description><category></category></item><item><title><![CDATA[开始刷leetcode day63:Contains Duplicate II]]></title><link>https://blog.youkuaiyun.com/a33b33C33/article/details/46857433</link><guid>https://blog.youkuaiyun.com/a33b33C33/article/details/46857433</guid><author>a33b33C33</author><pubDate>Mon, 13 Jul 2015 05:28:51 +0800</pubDate><description><![CDATA[Given an array of integers and an integer k,
 find out whether there there are two distinct indices i and j in
 the array such that nums[i] = nums[j] and
 the difference between iand j is
 at most]]></description><category></category></item></channel></rss>