<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/neostar2008</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; neostar2008]]></copyright><item><title><![CDATA[leetcode valid panlidrome]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/12233491</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/12233491</guid><author>neostar2008</author><pubDate>Wed, 02 Oct 2013 11:29:37 +0800</pubDate><description><![CDATA[public class Solution {
    public boolean isPalindrome(String s) {
        // Start typing your Java solution below
        if(s.length() == 1 || s.length() == 0 ) return true;
        
        Strin]]></description><category></category></item><item><title><![CDATA[leetcode edit distance]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/11840087</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/11840087</guid><author>neostar2008</author><pubDate>Fri, 20 Sep 2013 07:47:34 +0800</pubDate><description><![CDATA[public int minDistance(String word1, String word2) {
        // 
    	int rowNum = word1.length();
    	int colNum = word2.length();
    	int[][] dist = new int[rowNum + 1][colNum + 1];
    	
    	for]]></description><category></category></item><item><title><![CDATA[Leetcode Climbing Stairs]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/11588163</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/11588163</guid><author>neostar2008</author><pubDate>Thu, 12 Sep 2013 04:51:08 +0800</pubDate><description><![CDATA[public int climbStairs(int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
    	if(n == 0) return 0;
    	if(n == 1) return 1;
    	
    	int[] arr = new ]]></description><category></category></item><item><title><![CDATA[leetcode plus one]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/11588093</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/11588093</guid><author>neostar2008</author><pubDate>Thu, 12 Sep 2013 04:37:33 +0800</pubDate><description><![CDATA[public int[] plusOne(int[] digits) {
        if(digits.length < 1) return null;
    	
        String ans = "";
        int resi = 0;
        for(int i = digits.length - 1; i>=0; i--) {
        	int cu]]></description><category></category></item><item><title><![CDATA[leetcode add binary]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/11587365</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/11587365</guid><author>neostar2008</author><pubDate>Thu, 12 Sep 2013 02:27:20 +0800</pubDate><description><![CDATA[public String addBinary(String a, String b) {
        // 
    	char resi = '0';
    	
    	int lena = a.length();
    	int lenb = b.length();
    	int len = (lena > lenb ? lena : lenb) - 1;
    	int i]]></description><category></category></item><item><title><![CDATA[leetcode merge two sorted list]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/11551779</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/11551779</guid><author>neostar2008</author><pubDate>Wed, 11 Sep 2013 08:30:26 +0800</pubDate><description><![CDATA[public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        // Start typing your Java solution below
        // DO NOT write main() function
    	ListNode ans = new ListNode(0);
    	ListNode he]]></description><category></category></item><item><title><![CDATA[leetcode minimum path sum]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/11551589</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/11551589</guid><author>neostar2008</author><pubDate>Wed, 11 Sep 2013 08:12:44 +0800</pubDate><description><![CDATA[DP
Min[ i,  j] = Min( Min[i - 1][j] + grid[i][j], Min[i][j - 1] + grid[ i ][ j ]);



    public int minPathSum(int[][] grid) {
        // Start typing your Java solution below  [[1]]
        // ]]></description><category></category></item><item><title><![CDATA[leetcode length of last word]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9941885</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9941885</guid><author>neostar2008</author><pubDate>Tue, 13 Aug 2013 05:47:46 +0800</pubDate><description><![CDATA[public class LastWordLength {
	
    public int lengthOfLastWord(String s) {
        //
    	if(s == null || s.length() == 0 ) return 0;
    	
    	s = s.trim();
    	s = s.replaceAll("[ ]+", " ");
   ]]></description><category></category></item><item><title><![CDATA[leetcode insert interval]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9491135</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9491135</guid><author>neostar2008</author><pubDate>Fri, 26 Jul 2013 08:45:15 +0800</pubDate><description><![CDATA[Iterate the intervals list. Compare newInterval with each item in the list. If overlapping, update the item. Otherwise(no overlapping), add newInterval into list. Then delete duplicates or merge overl]]></description><category></category></item><item><title><![CDATA[leetcode merge intervals]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9462893</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9462893</guid><author>neostar2008</author><pubDate>Thu, 25 Jul 2013 05:28:22 +0800</pubDate><description><![CDATA[import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

class Interval {
	int start;
	int end;
	Interval() {start = 0; end = 0;}
	Interval(int s, int e) {start = s; end]]></description><category></category></item><item><title><![CDATA[leetcode Jump Game]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9388093</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9388093</guid><author>neostar2008</author><pubDate>Sat, 20 Jul 2013 08:26:53 +0800</pubDate><description><![CDATA[/* Leetcode JumpGame

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that posi]]></description><category></category></item><item><title><![CDATA[leetcode spiral matrix]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9388081</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9388081</guid><author>neostar2008</author><pubDate>Sat, 20 Jul 2013 08:13:23 +0800</pubDate><description><![CDATA[public ArrayList spiralOrder(int[][] matrix) {
        // 
    	ArrayList result = new ArrayList();
    	
    	if(matrix == null) return result;
    	if(matrix.length < 1) return result;
    	
    	
 ]]></description><category></category></item><item><title><![CDATA[leetcode maxSubArray]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9362281</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9362281</guid><author>neostar2008</author><pubDate>Thu, 18 Jul 2013 02:14:50 +0800</pubDate><description><![CDATA[O(n) solution
public class MaxSubArray {

    public int maxSubArray(int[] A) {
    	int sum = 0, curr = 0;
        int max = Integer.MIN_VALUE;
    	
    	for(curr = 0; curr < A.length; curr++) {]]></description><category></category></item><item><title><![CDATA[leetcode pow]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9349037</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9349037</guid><author>neostar2008</author><pubDate>Wed, 17 Jul 2013 02:58:08 +0800</pubDate><description><![CDATA[public class Pow {
//	//recursive version
//	//stack overflow when n is large
//    public double pow(double x, int n) {
//        
//    	if(n < 0) {
//    		return 1.0/pow(x, -n);
//    	}
//    	
/]]></description><category></category></item><item><title><![CDATA[leetcode anagrams]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9338669</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9338669</guid><author>neostar2008</author><pubDate>Tue, 16 Jul 2013 08:34:35 +0800</pubDate><description><![CDATA[import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;


/*
 * Given an array of strings, return all groups of strings that are anagrams.
 * Note: All inputs will be in lower-c]]></description><category></category></item><item><title><![CDATA[Leetcode Permutation II]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9338537</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9338537</guid><author>neostar2008</author><pubDate>Tue, 16 Jul 2013 07:56:00 +0800</pubDate><description><![CDATA[Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example,
[1,1,2] have
 the following unique permutations:
[1,1,2], [1,2,1],
 and [2,1,1]]></description><category></category></item><item><title><![CDATA[Java Object, Json 转换]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9107063</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9107063</guid><author>neostar2008</author><pubDate>Tue, 18 Jun 2013 11:20:58 +0800</pubDate><description><![CDATA[总目录索引： http://www.cnblogs.com/hoojo/archive/2011/04/27/2030264.html


Jackson：   http://blog.youkuaiyun.com/IBM_hoojo/article/details/6340762]]></description><category></category></item><item><title><![CDATA[Java XML Read]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/9105917</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/9105917</guid><author>neostar2008</author><pubDate>Sun, 16 Jun 2013 17:49:09 +0800</pubDate><description><![CDATA[http://blog.youkuaiyun.com/smcwwh/article/details/7183869






SAX: http://blog.youkuaiyun.com/lifaming15/article/details/1749695






The entity "nbsp" was referenced, but not declared.

http:/]]></description><category></category></item><item><title><![CDATA[Fibonaccci Heap]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/8906249</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/8906249</guid><author>neostar2008</author><pubDate>Thu, 09 May 2013 16:11:18 +0800</pubDate><description><![CDATA[http://mindlee.net/2011/09/29/fibonacci-heaps/]]></description><category></category></item><item><title><![CDATA[LeetCode Combination Sum]]></title><link>https://blog.youkuaiyun.com/neostar2008/article/details/8885862</link><guid>https://blog.youkuaiyun.com/neostar2008/article/details/8885862</guid><author>neostar2008</author><pubDate>Sun, 05 May 2013 07:18:09 +0800</pubDate><description><![CDATA[Good Article:    http://blog.youkuaiyun.com/zyfo2/article/details/8592955]]></description><category></category></item></channel></rss>