<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[diaocimo4777的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/diaocimo4777</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; diaocimo4777]]></copyright><item><title><![CDATA[leetcode-Course Schedule]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736068</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736068</guid><author>diaocimo4777</author><pubDate>Thu, 14 Sep 2017 13:04:00 +0800</pubDate><description><![CDATA[http://www.jyuan92.com/blog/leetcode-course-schedule/

http://www.cnblogs.com/zmyvszk/p/5348786.html

转载于:https://www.cnblogs.com/lilyfindjobs/p/7520080.html]]></description><category></category></item><item><title><![CDATA[Union-find]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736066</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736066</guid><author>diaocimo4777</author><pubDate>Tue, 12 Sep 2017 12:17:00 +0800</pubDate><description><![CDATA[讲解：http://www.cnblogs.com/SeaSky0606/p/4752941.html
leetcode 相关训练：http://www.cnblogs.com/zmyvszk/p/5351494.html

转载于:https://www.cnblogs.com/lilyfindjobs/p/7509505.html]]></description><category></category></item><item><title><![CDATA[Convert a given binary tree to double linked list]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736067</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736067</guid><author>diaocimo4777</author><pubDate>Sun, 10 Sep 2017 07:39:00 +0800</pubDate><description><![CDATA[public TreeNode binaryTree2List(TreeNode node)
	 {
		 if (node == null)
	            return node;
	  
	        // Convert to DLL using bintree2listUtil()
	        node = bintree2listUt...]]></description><category></category></item><item><title><![CDATA[Find distance between two give node of binary tree]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736064</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736064</guid><author>diaocimo4777</author><pubDate>Sun, 10 Sep 2017 07:04:00 +0800</pubDate><description><![CDATA[Dis(n1, n2) = Dis(root, n1) + Dis(root, n2) - 2* Dis(root, lca)



public static void main(String[] args) {
		// TODO Auto-generated method stub

		onsite2 onsite2=new onsite2();
		Tree...]]></description><category></category></item><item><title><![CDATA[leetcode Flatten Binary Tree to Linked List]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736062</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736062</guid><author>diaocimo4777</author><pubDate>Sun, 20 Aug 2017 04:49:00 +0800</pubDate><description><![CDATA[Given a binary tree, flatten it to a linked list in-place.
For example,Given
         1
        / \
       2   5
      / \   \
     3   4   6


The flattened tree should look like:
   ...]]></description><category></category></item><item><title><![CDATA[leetcode Populating Next Right Pointers in Each Node]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736060</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736060</guid><author>diaocimo4777</author><pubDate>Thu, 23 Jul 2015 08:30:00 +0800</pubDate><description><![CDATA[Given a binary tree
    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }


Populate each next pointer to point to its next right...]]></description><category></category></item><item><title><![CDATA[python os turtle]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736065</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736065</guid><author>diaocimo4777</author><pubDate>Sun, 24 May 2015 02:22:00 +0800</pubDate><description><![CDATA[import os

def rename_file():
    file_name_list=os.listdir(r"/Users/Lily/Documents/ASU1/CodePractise/prank")
    print(file_name_list)
    saved_path=os.getcwd()
    print("current worki...]]></description><category></category></item><item><title><![CDATA[Hadoop java 程序运行]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736063</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736063</guid><author>diaocimo4777</author><pubDate>Sat, 25 Apr 2015 07:11:00 +0800</pubDate><description><![CDATA[安装Hadoop：http://khangaonkar.blogspot.com/2012/09/hadoop-2x-tutorial.html
yarn-site.xmlAdd the following to etc/hadoop/yarn-site.xml.&lt;?xml version="1.0"?&gt;&lt;configuration&gt;&lt;proper...]]></description><category></category></item><item><title><![CDATA[yahoo pipes]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736061</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736061</guid><author>diaocimo4777</author><pubDate>Sat, 21 Mar 2015 10:50:00 +0800</pubDate><description><![CDATA[yahoo pipes 用来mash up.
可以将各个网站的信息组合起来发布
需要网站的RSS
https://pipes.yahoo.com/pipes/docs?doc=sources
注册yahoo即可使用。




转载于:https://www.cnblogs.com/lilyfindjobs/p/4355260.html...]]></description><category></category></item><item><title><![CDATA[python+postgreSql]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736058</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736058</guid><author>diaocimo4777</author><pubDate>Fri, 20 Mar 2015 06:29:00 +0800</pubDate><description><![CDATA[def getopenconnection(user='postgres', password='1234', dbname='dds_assgn1'):
    return psycopg2.connect("dbname='" + dbname + "' user='" + user + "' host='localhost' password='" + passwor...]]></description><category></category></item><item><title><![CDATA[Static and dynamic binding in java]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736056</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736056</guid><author>diaocimo4777</author><pubDate>Thu, 12 Mar 2015 12:50:00 +0800</pubDate><description><![CDATA[Static and dynamic binding in java


Before Iexplainstatic and dynamic binding in java, lets discuss few terms which will help you to understand the concepts better.

What is reference a...]]></description><category></category></item><item><title><![CDATA[leetcode Sort Listnode]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736042</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736042</guid><author>diaocimo4777</author><pubDate>Sun, 08 Mar 2015 07:20:00 +0800</pubDate><description><![CDATA[Sort a linked list inO(nlogn) time using constant space complexity.
findMiddle: 将listnode 不停的拆分
sort： 将拆分好的不同的sort
merge： 将sort好的，向上merge

/**
 * Definition for singly-linked list.
 * c...]]></description><category></category></item><item><title><![CDATA[检查密码的复杂性]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736039</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736039</guid><author>diaocimo4777</author><pubDate>Thu, 22 Jan 2015 13:05:00 +0800</pubDate><description><![CDATA[至少有小写字母，大写字母，数字，特殊字符

static bool IsLetter(char c)
{
    return (c &gt;= 'a' &amp;&amp; c &lt;= 'z') || (c &gt;= 'A' &amp;&amp; c &lt;= 'Z');
}

static bool IsDigit(char c)
{
    return ...]]></description><category></category></item><item><title><![CDATA[hackerrank Diameter of Binary Tree]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736040</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736040</guid><author>diaocimo4777</author><pubDate>Thu, 15 Jan 2015 12:31:00 +0800</pubDate><description><![CDATA[public class DiameterOfTree {   
public static int diameter = 0; 
public static int getDiameter(BinaryTreeNode root) {        
    if (root != null) {                     
        int ...]]></description><category></category></item><item><title><![CDATA[hackerrank first repeat word]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736036</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736036</guid><author>diaocimo4777</author><pubDate>Thu, 15 Jan 2015 12:22:00 +0800</pubDate><description><![CDATA[找出一个string中第一个重复出现的单词；
sample： he had had a good son.
output: had
句子中可能会出现，comma，colon， semicolon, dash, fullstop/dot
解法：1；dash和dot 都是regular expression中的，出现会有歧义，因此需要加上 转意符\\
    2, hash...]]></description><category></category></item><item><title><![CDATA[lintcode backpack]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736037</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736037</guid><author>diaocimo4777</author><pubDate>Wed, 14 Jan 2015 08:21:00 +0800</pubDate><description><![CDATA[Given n items with size A[i], an integer m denotes the size of a backpack. How full you can fill this backpack?
注意

You can not divide any item into small pieces.


样例

If we have 4 item...]]></description><category></category></item><item><title><![CDATA[leetcode excel Sheet Column Number]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736035</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736035</guid><author>diaocimo4777</author><pubDate>Wed, 14 Jan 2015 05:00:00 +0800</pubDate><description><![CDATA[Related to questionExcel Sheet Column Title
Given a column title as appear in an Excel sheet, return its corresponding column number.
For example:
    A -&gt; 1
    B -&gt; 2
    C -&gt; 3...]]></description><category></category></item><item><title><![CDATA[leetcode Intersection of Two Linked Lists]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736034</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736034</guid><author>diaocimo4777</author><pubDate>Wed, 14 Jan 2015 00:59:00 +0800</pubDate><description><![CDATA[Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:
A:          a1 → a2
                   ↘
        ...]]></description><category></category></item><item><title><![CDATA[leetcode 3sum]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736022</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736022</guid><author>diaocimo4777</author><pubDate>Sat, 27 Dec 2014 03:20:00 +0800</pubDate><description><![CDATA[Given an arraySofnintegers, are there elementsa,b,cinSsuch thata+b+c= 0? Find all unique triplets in the array which gives the sum of zero.
Note:

Elements in a triplet (a,b,c)...]]></description><category></category></item><item><title><![CDATA[leetcode majority elements]]></title><link>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736023</link><guid>https://blog.youkuaiyun.com/diaocimo4777/article/details/101736023</guid><author>diaocimo4777</author><pubDate>Fri, 26 Dec 2014 12:42:00 +0800</pubDate><description><![CDATA[Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.
You may assume that the array is non-empty and the majority element...]]></description><category></category></item></channel></rss>