<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u012575573的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u012575573</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u012575573]]></copyright><item><title><![CDATA[设计包含 min 函数的栈（栈）  java语言实现]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/39078765</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/39078765</guid><author>u012575573</author><pubDate>Fri, 05 Sep 2014 11:36:22 +0800</pubDate><description><![CDATA[//定义栈的数据结构，要求添加一个 min 函///数，能够得到栈的最小元素。
//要求函数 min、push 以及 pop 的时间复///杂度都是 O(1)。
//在栈里添加一个成员变量存放最小元素（或//者最小元素的位置，考虑到元素可以是其他//复杂的数据类型，因此存在最小元素的位置//更能减少存储空间）。每次push一个新元///素进栈的时候，如果该元素比当前的最小元//素还要小，则更新最小]]></description><category></category></item><item><title><![CDATA[将二叉树结构转换为双向链表 java语言实现]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/39078735</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/39078735</guid><author>u012575573</author><pubDate>Fri, 05 Sep 2014 11:31:06 +0800</pubDate><description><![CDATA[import java.util.ArrayList;


public class TreeToList 
{
	public static void main(String args[])
	{
		TreeToList ttl=new TreeToList();
		int[]a=new int[]{8,6,9,5,7,8,12};
		Nodel head=ttl.creatTree(a)]]></description><category></category></item><item><title><![CDATA[对一个数组进行螺旋式打印，java语言实现]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/39078711</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/39078711</guid><author>u012575573</author><pubDate>Fri, 05 Sep 2014 11:29:07 +0800</pubDate><description><![CDATA[public class CyclePrint 
{
	public static void main(String args[])
	{
		int[][]a=new int[][]{{1,2,3,4},{2,1,4,3},{3,4,1,2},{4,3,2,1}};
		CyclePrint cyc=new CyclePrint();
		cyc.printurn(a, 0, 4);
	}
	p]]></description><category></category></item><item><title><![CDATA[一个字符串中出现次数最多的单词 java语言实现]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/39078393</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/39078393</guid><author>u012575573</author><pubDate>Fri, 05 Sep 2014 11:11:56 +0800</pubDate><description><![CDATA[import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterato]]></description><category></category></item><item><title><![CDATA[链表的正逆序打印 java语言实现]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/39078355</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/39078355</guid><author>u012575573</author><pubDate>Fri, 05 Sep 2014 11:09:12 +0800</pubDate><description><![CDATA[import java.util.LinkedList;


public class ListPrint 
{
	public static void main(String args[])
	{
		LinkedList list=new LinkedList();
		list.add("china");
		list.add("sina");
		list.add("I");
		list]]></description><category></category></item><item><title><![CDATA[归并排序 java实现]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/39078221</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/39078221</guid><author>u012575573</author><pubDate>Fri, 05 Sep 2014 11:02:04 +0800</pubDate><description><![CDATA[2.	//归并排序采用的是分治算法：分治算法的基本思想是将一个规模为N的问题分解为K个规模//较小的子问题，这些子问题相互独立且与原问题性质相同。求出子问题的解，就可得到原//问题的解。 
//分治法解题的一般步骤： 
//（1）分解，将要解决的问题划分成若干规模较小的同类问题； 
//（2）求解，当子问题划分得足够小时，用较简单的方法解决； 
//（3）合并，按原问题的要求，将子问题的解逐层合并]]></description><category></category></item><item><title><![CDATA[插入排序 java语言实现]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/39078051</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/39078051</guid><author>u012575573</author><pubDate>Fri, 05 Sep 2014 10:52:26 +0800</pubDate><description><![CDATA[import java.util.LinkedList;
public class InsertTest
{
	public static void main(String args[])
	{
		int []a=new int[]{9,7,0,3,5,6,2,4,1,8};
		
		LinkedList list=new LinkedList();
		list.add(a[0]);
		
]]></description><category></category></item><item><title><![CDATA[通过标准输入设备输入一行语句以空格隔开，提取其中的每一个词]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38709165</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38709165</guid><author>u012575573</author><pubDate>Wed, 20 Aug 2014 17:24:37 +0800</pubDate><description><![CDATA[import java.util.Scanner;


public class ScannerTest 
{
	public static void main(String args[])
	{
		Scanner sc=new Scanner(System.in);
		String str=sc.nextLine();
		System.out.println(str);
		System.]]></description><category></category></item><item><title><![CDATA[输入字符串和字节数，截取子串(串中含有中文字符)]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38643197</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38643197</guid><author>u012575573</author><pubDate>Sun, 17 Aug 2014 21:15:52 +0800</pubDate><description><![CDATA[import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class SubStringTest 
{
	public static void main(String args[])
	{
		BufferedReader br=new Buffered]]></description><category></category></item><item><title><![CDATA[字符串排序问题]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38642155</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38642155</guid><author>u012575573</author><pubDate>Sun, 17 Aug 2014 20:50:11 +0800</pubDate><description><![CDATA[import java.util.LinkedList;


public class StringTurn 
{
	public static void main(String args[])
	{
		String[] str={"Bc","Ad","aC","Hello","X man","little","During","day"};
		String s=null;
		LinkedL]]></description><category></category></item><item><title><![CDATA[约瑟环问题的数组实现]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38636871</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38636871</guid><author>u012575573</author><pubDate>Sun, 17 Aug 2014 10:07:12 +0800</pubDate><description><![CDATA[public class YueSeHuan 
{
	public static void main(String args[])
	{		//30人
		int[]a=new int[30];
		for(int i=0;i<a.length;i++)
		{
			a[i]=i+1;
			System.out.println(a[i]);
		}
		int k=0;
		int j=0;
]]></description><category></category></item><item><title><![CDATA[输入一组整型数据，以逗号隔开，寻找出现次数大于总数一半的数]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38622213</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38622213</guid><author>u012575573</author><pubDate>Sat, 16 Aug 2014 23:12:23 +0800</pubDate><description><![CDATA[import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Map;
imp]]></description><category></category></item><item><title><![CDATA[判断输入的一行字符串中出现次数最多的字母]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38345865</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38345865</guid><author>u012575573</author><pubDate>Sat, 02 Aug 2014 10:11:25 +0800</pubDate><description><![CDATA[import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
imp]]></description><category></category></item><item><title><![CDATA[主动使用触发的初始化操作]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38332777</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38332777</guid><author>u012575573</author><pubDate>Fri, 01 Aug 2014 10:46:07 +0800</pubDate><description><![CDATA[class Parent
{
	static int a=3;
	static
	{
		System.out.println("Parent static block");
	}
}

class Child extends Parent
{
	static int b=4;
	static
	{
		System.out.println("Child static block");
	}
}
]]></description><category></category></item><item><title><![CDATA[类的 非主动使用不会触发类的初始化操作]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38332741</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38332741</guid><author>u012575573</author><pubDate>Fri, 01 Aug 2014 10:44:38 +0800</pubDate><description><![CDATA[public class Test2
{
	public static void main(String args[])
	{
		System.out.println(FinalTest.x);
	}
}


class FinalTest 
{
	public static final int x=6/3;//编译时的常量，不会触发类的初始化。因而静态代码块不执行
	static
	{
		S]]></description><category></category></item><item><title><![CDATA[类加载过程中静态变量的值变化细节]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/38317707</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/38317707</guid><author>u012575573</author><pubDate>Thu, 31 Jul 2014 19:51:28 +0800</pubDate><description><![CDATA[class Singleton
{
	private static Singleton singleton=new Singleton();
	public static int singleton1;
	public static int singleton2=0;
	
	//private static Singleton singleton=new Singleton();
	//放置在这里]]></description><category></category></item><item><title><![CDATA[斐波那契数列]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/37770425</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/37770425</guid><author>u012575573</author><pubDate>Mon, 14 Jul 2014 20:36:35 +0800</pubDate><description><![CDATA[import java.util.Scanner;


public class Fabenacii 
{
	public static void main(String args[])
	{
		int []a=new int [1024];
		a[0]=1;
		a[1]=1;
		for(int i=2;i<1024;i++)
		{
			a[i]=a[i-1]+a[i-2];
		}
]]></description><category></category></item><item><title><![CDATA[UDP实现服务器与客户端双向通信]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/37690267</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/37690267</guid><author>u012575573</author><pubDate>Fri, 11 Jul 2014 09:29:59 +0800</pubDate><description><![CDATA[package UDPconnection;

import java.io.IOException;
import java.net.DatagramPacket;
import java.net.DatagramSocket;
import java.net.InetAddress;
import java.net.SocketException;

public class UDPserve]]></description><category></category></item><item><title><![CDATA[基于TCP协议实现客户服务器的全双工通信]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/37654691</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/37654691</guid><author>u012575573</author><pubDate>Thu, 10 Jul 2014 12:57:07 +0800</pubDate><description><![CDATA[import java.io.IOException;
import java.net.ServerSocket;
import java.net.Socket;


public class MainServer 
{
	public static void main (String args[]) throws Exception 
	{
		ServerSocket ss=new Serve]]></description><category></category></item><item><title><![CDATA[客户端服务器端实现双向通信]]></title><link>https://blog.youkuaiyun.com/u012575573/article/details/33716913</link><guid>https://blog.youkuaiyun.com/u012575573/article/details/33716913</guid><author>u012575573</author><pubDate>Mon, 23 Jun 2014 10:23:35 +0800</pubDate><description><![CDATA[import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.net.ServerSocket;
import java.net.Socket;


public class TcpServer 
{
	public static void main(String a]]></description><category></category></item></channel></rss>