<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lpf521的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lpf521</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lpf521]]></copyright><item><title><![CDATA[输入一个整数数组，调整数组中数字的顺序，使得所有奇数位于数组的前半部分，所有偶数位于数组的后半部分。要求时间复杂度为O(n)...]]></title><link>https://blog.youkuaiyun.com/lpf521/article/details/84429641</link><guid>https://blog.youkuaiyun.com/lpf521/article/details/84429641</guid><author>lpf521</author><pubDate>Sat, 11 May 2013 13:39:32 +0800</pubDate><description><![CDATA[
package org.base.array;

public class ArrayUtil {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] source = {1,3,2,4,6,7,5};...]]></description><category></category></item></channel></rss>