<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Isaacle的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Isaacle</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Isaacle]]></copyright><item><title><![CDATA[Go  capacity of slice when append]]></title><link>https://blog.youkuaiyun.com/Isaacle/article/details/79127443</link><guid>https://blog.youkuaiyun.com/Isaacle/article/details/79127443</guid><author>Isaacle</author><pubDate>Mon, 22 Jan 2018 12:01:54 +0800</pubDate><description><![CDATA[In go-tour the offcial guide, the append make the capacity
package main

import "fmt"

func main() {
	a := make([]int,0)
	printSlice("a", a)

	// append works on nil slices.
	a = append(a, 0)
	printS]]></description><category></category></item><item><title><![CDATA[Android入门]]></title><link>https://blog.youkuaiyun.com/Isaacle/article/details/75137326</link><guid>https://blog.youkuaiyun.com/Isaacle/article/details/75137326</guid><author>Isaacle</author><pubDate>Fri, 14 Jul 2017 22:36:35 +0800</pubDate><description><![CDATA[Android入门
记录自己遇到的坑
基础向
随时断更
一跨Activity找到View 
习惯性用FindViewbyID,但是对于Navigation Header里面需要先getHeader();获取一个Nav 的View. 
        navigationView.setNavigationItemSelectedListener(this); 
        View header]]></description><category></category></item><item><title><![CDATA[OSX WebGoat Installation]]></title><link>https://blog.youkuaiyun.com/Isaacle/article/details/51499305</link><guid>https://blog.youkuaiyun.com/Isaacle/article/details/51499305</guid><author>Isaacle</author><pubDate>Wed, 25 May 2016 16:12:31 +0800</pubDate><description><![CDATA[WebGoat for OSX 5.4]]></description><category></category></item><item><title><![CDATA[Int]]></title><link>https://blog.youkuaiyun.com/Isaacle/article/details/51485339</link><guid>https://blog.youkuaiyun.com/Isaacle/article/details/51485339</guid><author>Isaacle</author><pubDate>Mon, 23 May 2016 22:22:33 +0800</pubDate><description><![CDATA[64位机器上Int 1<<31是最小值而要取到最大值必须~（1 <<31)]]></description><category></category></item><item><title><![CDATA[4-1 Shortest Path [3]]]></title><link>https://blog.youkuaiyun.com/Isaacle/article/details/50422129</link><guid>https://blog.youkuaiyun.com/Isaacle/article/details/50422129</guid><author>Isaacle</author><pubDate>Mon, 28 Dec 2015 22:52:13 +0800</pubDate><description><![CDATA[question from ptaWrite a program to not only find the weighted shortest distances, but also count the number of different minimum paths from any vertex to a given source vertex in a digraph. It is guar]]></description><category></category></item></channel></rss>