<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[canglingye的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/canglingye</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; canglingye]]></copyright><item><title><![CDATA[Java停止线程]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/50474747</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/50474747</guid><author>canglingye</author><pubDate>Thu, 07 Jan 2016 10:59:09 +0800</pubDate><description><![CDATA[以生产者消费者模型为例：
生产者：
/**
 *@function
 *@modified 2016年1月7日 上午10:01:10
 *@author Zhangpengye
 */

package LearnBasic;

import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.Exec]]></description><category></category></item><item><title><![CDATA[LeetCode——Perfect Squares]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/48368969</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/48368969</guid><author>canglingye</author><pubDate>Fri, 11 Sep 2015 10:25:42 +0800</pubDate><description><![CDATA[题目描述：
将数字n，分解成k个平方数之和。如12 = 4 + 4 + 4，13 = 9 + 4。求k的最小值。
        题目解法：
初读题目，发现如果n本身就是平方数最完美不过了，这样直接求得k = 1。但是事情并不是这样。
比如13，其平方根为3.6左右，不是平方数。那么，先尝试将其分为 9(3的平方) + 4 ，然后再尝试对4进行分解，发现4恰巧是完全平方数，则13结果为 9]]></description><category></category></item><item><title><![CDATA[LeetCode——First Bad Version]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/48287223</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/48287223</guid><author>canglingye</author><pubDate>Tue, 08 Sep 2015 10:17:12 +0800</pubDate><description><![CDATA[题目描述：
        现有从n个版本产品，由于第x个版本发生错误，导致x版本以及之后的所有版本都发生错误。请找出x版本的位置
    解法：
        比较明显的二分解题方法，二分查找即可。
        但是，在确定中间位置时，请使用：
           int middle = start + (end - start)/2;   (1)

         而]]></description><category></category></item><item><title><![CDATA[LeetCode——H-Index]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/48207011</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/48207011</guid><author>canglingye</author><pubDate>Fri, 04 Sep 2015 10:05:45 +0800</pubDate><description><![CDATA[LeetCode——H-Index解法]]></description><category></category></item><item><title><![CDATA[LeetCode——House Robber]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/44853375</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/44853375</guid><author>canglingye</author><pubDate>Fri, 03 Apr 2015 11:39:48 +0800</pubDate><description><![CDATA[题目描述 LeetCode - House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed.]]></description><category></category></item><item><title><![CDATA[Spark不常用的参数调节]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/44411769</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/44411769</guid><author>canglingye</author><pubDate>Wed, 18 Mar 2015 15:53:27 +0800</pubDate><description><![CDATA[内容基本都来自：http://spark.apache.org/docs/1.0.2/tuning.html，自己随手记下来点东西。
数据序列化对于分布式框架来说，牵扯到数据传输的问题，故序列化问题非常重要。
在spark中，默认采用的是java的序列化(java.io.Serializable)，此种序列化的效率较低。建议采用Kryo serialization的序列化方法，但是此种方法的不足之处]]></description><category></category></item><item><title><![CDATA[LeetCode-Number of 1 Bits]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/44177479</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/44177479</guid><author>canglingye</author><pubDate>Tue, 10 Mar 2015 16:49:19 +0800</pubDate><description><![CDATA[问题描述Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11’ has binary representation 000000000]]></description><category></category></item><item><title><![CDATA[LeetCode-Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/44079285</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/44079285</guid><author>canglingye</author><pubDate>Thu, 05 Mar 2015 10:39:14 +0800</pubDate><description><![CDATA[题目描述Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. F]]></description><category></category></item><item><title><![CDATA[LeetCode-Sort Colors]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/44034447</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/44034447</guid><author>canglingye</author><pubDate>Tue, 03 Mar 2015 09:54:27 +0800</pubDate><description><![CDATA[Sort Colors题目描述Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the]]></description><category></category></item><item><title><![CDATA[LeetCode-Best Time to Buy and Sell Stock III]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/44015005</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/44015005</guid><author>canglingye</author><pubDate>Mon, 02 Mar 2015 09:47:38 +0800</pubDate><description><![CDATA[题目描述Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note: 
You may not e]]></description><category></category></item><item><title><![CDATA[LeetCode-Sort List]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/43876487</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/43876487</guid><author>canglingye</author><pubDate>Wed, 18 Feb 2015 12:56:15 +0800</pubDate><description><![CDATA[LeetCode-Sort List题目描述如下： 
Sort a linked list in O(n log n) time using constant space complexity. 
解题思路： 
即找一个时间复杂度为O(nlogn)的基于链表的排序算法，那么，只有归并排序符合要求。快速排序之类的排序算法都需要随机访问能力，链表不符合要求。 
然后按照一般的递归归并排序来看，其要占用O]]></description><category></category></item><item><title><![CDATA[LeetCode——Repeated DNA Sequences]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/43669979</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/43669979</guid><author>canglingye</author><pubDate>Mon, 09 Feb 2015 13:40:26 +0800</pubDate><description><![CDATA[题目描述：


All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the]]></description><category></category></item><item><title><![CDATA[基础算法——快速排序]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/43053469</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/43053469</guid><author>canglingye</author><pubDate>Fri, 23 Jan 2015 11:36:43 +0800</pubDate><description><![CDATA[package QuickSort;

import java.util.Random;

public class QuickSort {
	
	static public void swap(int a, int b)
	{
		int temp = 0;
		temp = a;
		a = b;
		b = temp;
	}
	static public void quickSort(int]]></description><category></category></item><item><title><![CDATA[kill掉yarn正在运行的job]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/42168699</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/42168699</guid><author>canglingye</author><pubDate>Fri, 26 Dec 2014 10:41:48 +0800</pubDate><description><![CDATA[在yarn的安装目录下的bin文件夹中，运行命令./yarn application -status application_1416899352676_0008。具体的命令格式可以通过执行./yran获取]]></description><category></category></item><item><title><![CDATA[关于SparkMLlib的基础数据结构Spark-MLlib-Basics]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/41316193</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/41316193</guid><author>canglingye</author><pubDate>Thu, 20 Nov 2014 17:07:43 +0800</pubDate><description><![CDATA[此部分主要降价写关于MLlib的集中基础的数据结构]]></description><category></category></item><item><title><![CDATA[Hadoop的分布式缓存DistributedCache使用方法]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/39272835</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/39272835</guid><author>canglingye</author><pubDate>Sun, 14 Sep 2014 20:36:02 +0800</pubDate><description><![CDATA[本人hadoop使用环境：
在本机用]]></description><category></category></item><item><title><![CDATA[在windows基于Eclipse编写hadoop时，遇到的 WARN util.NativeCodeLoader问题]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/39268365</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/39268365</guid><author>canglingye</author><pubDate>Sun, 14 Sep 2014 10:53:56 +0800</pubDate><description><![CDATA[问题全文如下：]]></description><category></category></item><item><title><![CDATA[Java编程思想笔记——第十六章]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/37763663</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/37763663</guid><author>canglingye</author><pubDate>Mon, 14 Jul 2014 15:49:28 +0800</pubDate><description><![CDATA[1.1 数组为什么特殊：
数组和容器直接的区别主要有三个方面]]></description><category></category></item><item><title><![CDATA[Java编程思想笔记——第十四章&&第十五章]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/37757249</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/37757249</guid><author>canglingye</author><pubDate>Mon, 14 Jul 2014 10:49:37 +0800</pubDate><description><![CDATA[这两张内容比较复杂，等第二遍再详细介绍。]]></description><category></category></item><item><title><![CDATA[Java编程思想笔记——第十三章]]></title><link>https://blog.youkuaiyun.com/canglingye/article/details/37592307</link><guid>https://blog.youkuaiyun.com/canglingye/article/details/37592307</guid><author>canglingye</author><pubDate>Wed, 09 Jul 2014 09:50:44 +0800</pubDate><description><![CDATA[1、String对象是不可变的。查看JDKwendang]]></description><category></category></item></channel></rss>