<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lee_Caecar</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lee_Caecar]]></copyright><item><title><![CDATA[[LeetCode] Unique Binary Search Trees]]></title><link>https://blog.youkuaiyun.com/lee_Caecar/article/details/42706989</link><guid>https://blog.youkuaiyun.com/lee_Caecar/article/details/42706989</guid><author>lee_Caecar</author><pubDate>Wed, 14 Jan 2015 12:57:44 +0800</pubDate><description><![CDATA[Given n,
 how many structurally unique BST's (binary
 search trees) that store values 1...n?


For example,
Given n = 3, there are a total of 5 unique BST's.
   1         3     3      2      1
]]></description><category></category></item><item><title><![CDATA[[LeetCode] Linked List CycleII]]></title><link>https://blog.youkuaiyun.com/lee_Caecar/article/details/37594537</link><guid>https://blog.youkuaiyun.com/lee_Caecar/article/details/37594537</guid><author>lee_Caecar</author><pubDate>Wed, 09 Jul 2014 11:36:05 +0800</pubDate><description><![CDATA[Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

Follow up:
Can you solve it without using extra space?]]></description><category></category></item><item><title><![CDATA[java学习笔记05--字符串]]></title><link>https://blog.youkuaiyun.com/lee_Caecar/article/details/12300853</link><guid>https://blog.youkuaiyun.com/lee_Caecar/article/details/12300853</guid><author>lee_Caecar</author><pubDate>Sat, 05 Oct 2013 04:58:19 +0800</pubDate><description><![CDATA[原作者写得很好，简明易懂，条理清晰

原文地址http://blog.youkuaiyun.com/itmyhome1990/article/details/8932882







一、String类

由字符所组成的一串文字符号被称之为字符串。在java中字符串不仅仅是字符数组，而且是String类的一个实例，可以使用String类来构建。

字符串的每个字符是使用Unic]]></description><category></category></item><item><title><![CDATA[IOstream学习]]></title><link>https://blog.youkuaiyun.com/lee_Caecar/article/details/12077823</link><guid>https://blog.youkuaiyun.com/lee_Caecar/article/details/12077823</guid><author>lee_Caecar</author><pubDate>Fri, 27 Sep 2013 05:46:12 +0800</pubDate><description><![CDATA[//待完善
在老师给的Homework1 example里这位同学写的输入流如下

import java.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOE]]></description><category></category></item><item><title><![CDATA[Java 学习]]></title><link>https://blog.youkuaiyun.com/lee_Caecar/article/details/12077119</link><guid>https://blog.youkuaiyun.com/lee_Caecar/article/details/12077119</guid><author>lee_Caecar</author><pubDate>Fri, 27 Sep 2013 04:18:28 +0800</pubDate><description><![CDATA[荒废了两年的学业，一来上课发现自己基础还是差了点，想想曾经度日方式，唏嘘不已。看到一亩三分地上一master才开始学计算机的人花了半年从hello world到编译器，我才感觉到世界上没有什么是不可能的，只要你去拼搏。
以我的基础，思前想后，半年也差不多了吧。最近总结出了一个学习的经验，姑且叫滚雪球效应吧，意思是学习的过程其实是一个滚雪球的过程，一开始不必大张旗鼓一天学习多少量多少量；从小做起，]]></description><category></category></item><item><title><![CDATA[Java学习]]></title><link>https://blog.youkuaiyun.com/lee_Caecar/article/details/11625469</link><guid>https://blog.youkuaiyun.com/lee_Caecar/article/details/11625469</guid><author>lee_Caecar</author><pubDate>Fri, 13 Sep 2013 06:35:45 +0800</pubDate><description><![CDATA[//To do


To be continue]]></description><category></category></item><item><title><![CDATA[杭电OJ 2054]]></title><link>https://blog.youkuaiyun.com/lee_Caecar/article/details/7857646</link><guid>https://blog.youkuaiyun.com/lee_Caecar/article/details/7857646</guid><author>lee_Caecar</author><pubDate>Sun, 12 Aug 2012 18:57:01 +0800</pubDate><description><![CDATA[Problem Description
Give you two numbers A and B, if A is equal to B, you should print "YES", or print "NO".

Input
each test case contains two numbers A and B.
 
Output
for each case, if A is]]></description><category></category></item><item><title><![CDATA[大数.去除小数点后的0]]></title><link>https://blog.youkuaiyun.com/lee_Caecar/article/details/7857641</link><guid>https://blog.youkuaiyun.com/lee_Caecar/article/details/7857641</guid><author>lee_Caecar</author><pubDate>Sun, 12 Aug 2012 18:52:32 +0800</pubDate><description><![CDATA[void delete_zero(char* s)
{
    int len;
    int i;
    len = strlen(s);
    for (i = len; i >= 0; i--)
    {
        if (s[i] == '0')
            len--;
        else 
            break;]]></description><category></category></item></channel></rss>