<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hongxiuzhe]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u013573813</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u013573813]]></copyright><item><title><![CDATA[动态代理]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/70172300</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/70172300</guid><author>u013573813</author><pubDate>Fri, 14 Apr 2017 16:18:49 +0800</pubDate><description><![CDATA[参考文献：
http://www.jianshu.com/p/6f6bb2f0ece9
http://wiki.jikexueyuan.com/project/java-reflection/java-dynamic.html



动态代理的好处


动态代理中接口中的所有方法都能转移到handler的一个invoke方法中处理；静态代理中每个方法都要有一个对应的代理增强方法；]]></description><category></category></item><item><title><![CDATA[Java集合]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/70161199</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/70161199</guid><author>u013573813</author><pubDate>Thu, 13 Apr 2017 21:04:34 +0800</pubDate><description><![CDATA[参考文献链接：http://wiki.jikexueyuan.com/project/java-collection/concurrenthashmap.html
ArrayList的实现原理


ArrayList底层使用数组实现；空list的默认初始容量大小为10；若添加元素后会超出当前数组的长度，则需要对数组进行扩容，每次扩容约为原数组容量的1.5倍，扩容后一次性把所有元素复制到新的]]></description><category></category></item><item><title><![CDATA[MySQL索引]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/70053458</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/70053458</guid><author>u013573813</author><pubDate>Tue, 11 Apr 2017 15:17:06 +0800</pubDate><description><![CDATA[一、索引类型
普通索引：没有任何限制；
唯一索引：索引列必须唯一，但允许为空；
逐渐索引：唯一且不许为空；
全文索引：用于搜索较长的一篇文章时效果较好；
组合索引：一个索引包含多列，遵循“最左前缀”原则；
组合索引(A/B/C)与多个单列索引(A、B、C)区别：


使用组合索引(A/B/C)相当于分别创建了索引ABC，AB，A；使用三个单列索引，但是查询时Mysql只会用到其中]]></description><category></category></item><item><title><![CDATA[Spark on Yarn的运行原理]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/69831344</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/69831344</guid><author>u013573813</author><pubDate>Sun, 09 Apr 2017 17:52:44 +0800</pubDate><description><![CDATA[一、YARN是集群的资源管理系统
1、ResourceManager：负责整个集群的资源管理和分配。
2、ApplicationMaster：YARN中每个Application对应一个AM进程，负责与RM协商获取资源，获取资源后告诉NodeManager为其启动Container。
3、NodeManager：每个节点的资源和任务管理器，负责启动/停止Container，并监视资源使用情况]]></description><category></category></item><item><title><![CDATA[java虚拟机]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/68927125</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/68927125</guid><author>u013573813</author><pubDate>Fri, 31 Mar 2017 21:29:10 +0800</pubDate><description><![CDATA[什么是GCroots?
垃圾回收器搜索路径的起点。]]></description><category></category></item><item><title><![CDATA[10、二进制中1的个数]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/63297111</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/63297111</guid><author>u013573813</author><pubDate>Sat, 18 Mar 2017 22:07:17 +0800</pubDate><description><![CDATA[题目
输入一个整数，输出该数二进制表示中1的个数。其中负数用补码表示

我的解法
public int NumberOf1(int n) {
		int[] list = new int[32];
		int res = 0;

		int temp = Math.abs(n);
		int index = 31;
		while (temp != 0) {
			list[index] ]]></description><category></category></item><item><title><![CDATA[两个栈实现队列]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/62883247</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/62883247</guid><author>u013573813</author><pubDate>Fri, 17 Mar 2017 10:59:18 +0800</pubDate><description><![CDATA[题目
用两个栈来实现一个队列，完成队列的Push和Pop操作。 队列中的元素为int类型。


我的解法
import java.util.Stack;

public class Solution {
    Stack stack1 = new Stack();
    Stack stack2 = new Stack();
    
    public void push(int]]></description><category></category></item><item><title><![CDATA[27、二叉搜索树与双向链表]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/62237303</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/62237303</guid><author>u013573813</author><pubDate>Wed, 15 Mar 2017 21:58:10 +0800</pubDate><description><![CDATA[输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。


我的解法
/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
 ]]></description><category></category></item><item><title><![CDATA[多线程基本知识]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/60584213</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/60584213</guid><author>u013573813</author><pubDate>Tue, 07 Mar 2017 16:36:31 +0800</pubDate><description><![CDATA[一、基本概念
一个应用程序就是一个进程，操作系统上可以有多个进程，一个进程中可以有多个线程。
一个CPU一个时刻只能运行一个线程，当有多个CPU时可以同时并行运行多个线程，但是线程数大于CPU数时，会有线程处于阻塞状态。
二、线程的生命周期
状态：新建、就绪、运行、阻塞、死亡。
阻塞：线程没有获取CPU资源，不能执行。


三、控制线程状态
join()方法：在thread1中执]]></description><category></category></item><item><title><![CDATA[hashmap的原理]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/60581154</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/60581154</guid><author>u013573813</author><pubDate>Mon, 06 Mar 2017 16:37:02 +0800</pubDate><description><![CDATA[HashMap也是我们使用非常多的Collection，它是基于哈希表的 Map 接口的实现，以key-value的形式存在。在HashMap中，key-value总是会当做一个整体来处理，系统会根据hash算法来来计算key-value的存储位置，我们总是可以通过key快速地存、取value。下面就来分析HashMap的存取。

一、定义

      HashMap实现了Map接口，继]]></description><category></category></item><item><title><![CDATA[Java的socket编程]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/60468552</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/60468552</guid><author>u013573813</author><pubDate>Sun, 05 Mar 2017 16:38:15 +0800</pubDate><description><![CDATA[一、原理
服务器端用serversocket对象监控端口。客户端用socket对象发送请求来建立连接，当服务器端收到请求后，用accecpt()方法生成socket对象来建立连接。
二、客户端发送、接受示例
package grammar;
import java.io.*;
import java.net.*;

public class MyServer {

	public stati]]></description><category></category></item><item><title><![CDATA[167. Two Sum II - Input array is sorted]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/59112151</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/59112151</guid><author>u013573813</author><pubDate>Wed, 01 Mar 2017 17:15:56 +0800</pubDate><description><![CDATA[题目


Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the tw]]></description><category></category></item><item><title><![CDATA[7. Reverse Integer]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/58716539</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/58716539</guid><author>u013573813</author><pubDate>Tue, 28 Feb 2017 23:49:37 +0800</pubDate><description><![CDATA[题目

Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
我的解答
public class Solution {
    public int reverse(int x) {
        int max = Integer.MAX_VALUE;
]]></description><category></category></item><item><title><![CDATA[9. Palindrome Number]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/58606602</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/58606602</guid><author>u013573813</author><pubDate>Tue, 28 Feb 2017 17:35:26 +0800</pubDate><description><![CDATA[题目

Determine whether an integer is a palindrome. Do this without extra space.
我的解法
public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0)
            return false;
   ]]></description><category></category></item><item><title><![CDATA[13. Roman to Integer（不懂规则）]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/58603202</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/58603202</guid><author>u013573813</author><pubDate>Tue, 28 Feb 2017 16:26:57 +0800</pubDate><description><![CDATA[题目

Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.

搞不懂换算规则。。。。]]></description><category></category></item><item><title><![CDATA[66. Plus One]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/58596713</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/58596713</guid><author>u013573813</author><pubDate>Tue, 28 Feb 2017 15:28:03 +0800</pubDate><description><![CDATA[题目

Given a non-negative integer represented as a 
non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The ]]></description><category></category></item><item><title><![CDATA[67. Add Binary]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/58588549</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/58588549</guid><author>u013573813</author><pubDate>Tue, 28 Feb 2017 11:28:58 +0800</pubDate><description><![CDATA[题目

Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100".
我的解法
public class Solution {
    public String addBinary(String a, String b) ]]></description><category></category></item><item><title><![CDATA[69. Sqrt(x)]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/58586482</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/58586482</guid><author>u013573813</author><pubDate>Tue, 28 Feb 2017 10:29:03 +0800</pubDate><description><![CDATA[题目

Implement int sqrt(int x).
Compute and return the square root of x.
我的解法
public class Solution {
    public int mySqrt(int x) {
        int s = 1;
        int e = x;
        long mid = 0;
   ]]></description><category></category></item><item><title><![CDATA[168. Excel Sheet Column Title]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/58257688</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/58257688</guid><author>u013573813</author><pubDate>Mon, 27 Feb 2017 21:12:00 +0800</pubDate><description><![CDATA[题目

Given a positive integer, return its corresponding column title as appear in an Excel sheet.
For example:
    1 -> A
    2 -> B
    3 -> C
    ...
    26 -> Z
    27 -> AA
    28 -> AB ]]></description><category></category></item><item><title><![CDATA[171. Excel Sheet Column Number]]></title><link>https://blog.youkuaiyun.com/u013573813/article/details/58228526</link><guid>https://blog.youkuaiyun.com/u013573813/article/details/58228526</guid><author>u013573813</author><pubDate>Mon, 27 Feb 2017 20:03:02 +0800</pubDate><description><![CDATA[题目

Related to question 
Excel Sheet Column Title
Given a column title as appear in an Excel sheet, return its corresponding column number.
For example:
    A -> 1
    B -> 2
    C -> 3
    .]]></description><category></category></item></channel></rss>