<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[步履不停的橙子]]></title><description><![CDATA[你听的的、你看到的]]></description><link>https://blog.youkuaiyun.com/u011296723</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u011296723]]></copyright><item><title><![CDATA[JavaMail的学习和使用]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82222963</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82222963</guid><author>u011296723</author><pubDate>Thu, 30 Aug 2018 16:00:14 +0800</pubDate><description><![CDATA[JavaMail的学习和使用

package cn.itcast.javamail;

import java.io.IOException; 
import java.util.Properties;

import javax.activation.DataHandler; 
import javax.activation.DataSource; 
import javax.activati...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题50：第一个只出现一次的字符》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82152579</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82152579</guid><author>u011296723</author><pubDate>Tue, 28 Aug 2018 18:33:09 +0800</pubDate><description><![CDATA[《剑指offer—面试题50：第一个只出现一次的字符》  
注明：仅个人学习笔记 

import java.util.HashMap; 
import java.util.Map;

/** 
 *  
 *  
 *         第一个只出现一次的字符 
 *  
 *         在字符串中，找出第一个只出现一次的字符 如输入“abaccdeff” 输出‘b’ 
 *  
 *   ...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题49：丑数》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82150884</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82150884</guid><author>u011296723</author><pubDate>Tue, 28 Aug 2018 16:57:53 +0800</pubDate><description><![CDATA[《剑指offer—面试题49：丑数》 
 注明：仅个人学习笔记

/**方法一，用空间换时间 
 * 
 *         用一个数组去保存丑数，再在丑数中去找需要的第几个丑数 
 * 
 */ 
public class GetUglyNumber49_2 
{ 
    public int GetUglyNumber_Solution(int index) 
    {

    if (...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题48：最长不含重复字符的子字符串》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82144160</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82144160</guid><author>u011296723</author><pubDate>Tue, 28 Aug 2018 10:46:32 +0800</pubDate><description><![CDATA[《剑指offer—面试题48：最长不含重复字符的子字符串》  
注明：仅个人学习笔记

方法一参考：https://blog.youkuaiyun.com/qq_28618765/article/details/65627503 
方法二参考：https://blog.youkuaiyun.com/m0_37862405/article/details/80369128

import java.util.HashMap...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题47：礼物的最大值》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82116522</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82116522</guid><author>u011296723</author><pubDate>Mon, 27 Aug 2018 17:38:06 +0800</pubDate><description><![CDATA[《剑指offer—面试题47：礼物的最大值》  
注明：仅个人学习笔记  
详细分析见书上笔记

public int getMaxValue_solution(int[] values, int rows, int cols) 
    { 
        if (values == null || rows &amp;lt;= 0 || cols &amp;lt;= 0) 
        { 
     ...]]></description><category></category></item><item><title><![CDATA[一个二维数组中元素的index和其展开后的一维数组中元素的index对应关系]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82115072</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82115072</guid><author>u011296723</author><pubDate>Mon, 27 Aug 2018 16:32:57 +0800</pubDate><description><![CDATA[一个二维数组中的元素和其展开后的一维数组中的元素的对应关系

二维数组a[ ][ ]是mxn维， 
                    且int m = a.length;//rows 
                        int n = a[0].length;//cols

展开后的一维数组大小int[] b = new int[m*n];

二维数组中元素的index和其展开...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题46：把数字翻译成字符串》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82114245</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82114245</guid><author>u011296723</author><pubDate>Mon, 27 Aug 2018 15:56:37 +0800</pubDate><description><![CDATA[《剑指offer—面试题46：把数字翻译成字符串》  
注明：仅个人学习笔记

详细分析和解题思路见书本笔记

/** 
 *  
 * 给定一个数字，按照如下规则把它翻译为字符串：0-&amp;gt;a, 1-&amp;gt;b, 2-&amp;gt;c,…,25-&amp;gt;z 
 *  
 *  
 * 用递归自顶向下分析，得到递推公式 
 * 用动态规划自底向上求解，减少重复子问题求解 
 * 
 */ 
publi...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题45：把数组排成最小的数》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82108531</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82108531</guid><author>u011296723</author><pubDate>Mon, 27 Aug 2018 10:30:11 +0800</pubDate><description><![CDATA[《剑指offer—面试题45：把数组排成最小的数》  
注明：仅个人学习笔记 

import java.util.ArrayList; 
import java.util.Collections; 
import java.util.Comparator;

/** 
 *  
 *  
 *         把数组排成最小的数 输入一个正整数数组，把数组里面所有数字拼接起来排成一个数，打印能拼...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题44：数字序列中某一位的数字》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82082646</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82082646</guid><author>u011296723</author><pubDate>Sun, 26 Aug 2018 17:42:22 +0800</pubDate><description><![CDATA[《剑指offer—面试题44：数字序列中某一位的数字》  
注明：仅个人学习笔记

在看不懂书上解题思路的情况下，建议阅读以下博客中的解题思路： 
https://blog.youkuaiyun.com/m0_37950361/article/details/80633177

代码是参考书上进行实现：

/** 
 *  
 * 数字序列中某一位的数字，序列位数从0开始 
 *  
 * @param in...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题43：1~n整数中1出现的次数》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82078980</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82078980</guid><author>u011296723</author><pubDate>Sun, 26 Aug 2018 11:17:51 +0800</pubDate><description><![CDATA[《剑指offer—面试题43：1~n整数中1出现的次数》  
注明：仅个人学习笔记 
/** 
 *  
 *         从1~n整数中1出现的次数，不考虑时间效率的解法 
 * 
 */ 
public class NumberOf1Between1AndN43 
{ 
    public int NumberOf1Between1AndN_Solution(int n) 
    { ...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题42：连续子数组的最大和》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82077987</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82077987</guid><author>u011296723</author><pubDate>Sun, 26 Aug 2018 09:38:19 +0800</pubDate><description><![CDATA[《剑指offer—面试题42：连续子数组的最大和》 
注明：仅个人学习笔记 

/** 
 *  
 *  
 * 连续子数组的最大和 
 * 
 */ 
public class FindGreatestSumOfSubArray42 
{

boolean g_InvalidInput = false;// 来标记是否输入无效

public int FindGreatestSumOfSubA...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题40：最小的k个数》——海量数据]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82020784</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82020784</guid><author>u011296723</author><pubDate>Fri, 24 Aug 2018 16:18:20 +0800</pubDate><description><![CDATA[《剑指offer—面试题40：最小的k个数》——海量数据 
注明：仅个人学习笔记 

import java.util.ArrayList; 
/** 
 *  
 * 
 *  
 *         最小的k个数 输入n个整数，找出其中最小的k个整数  
 *         方法一：可以将这n个数排序，最终得到排序后的前k个数即为所求  
 *         方法二：使用大小为k的容器，将...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题38：字符串的排序》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/82013878</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/82013878</guid><author>u011296723</author><pubDate>Fri, 24 Aug 2018 10:43:18 +0800</pubDate><description><![CDATA[《剑指offer—面试题38：字符串的排序》 
注明：仅个人学习笔记

https://www.nowcoder.com/profile/631996/codeBookDetail?submissionId=1512262]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题33：二叉搜索树的后序遍历序列》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/81974264</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/81974264</guid><author>u011296723</author><pubDate>Thu, 23 Aug 2018 09:02:42 +0800</pubDate><description><![CDATA[《剑指offer—面试题33：二叉搜索树的后序遍历序列》 
注明：仅个人学习笔记

Java - 数组拷贝的几种方式： 
                https://blog.youkuaiyun.com/u011669700/article/details/79323251

import java.util.Arrays;

/** 
 *  
 *  
 *         二叉搜索树的后序遍历序列...]]></description><category></category></item><item><title><![CDATA[红黑树讲解]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/81904092</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/81904092</guid><author>u011296723</author><pubDate>Tue, 21 Aug 2018 11:06:35 +0800</pubDate><description><![CDATA[注明：仅个人学习笔记

史上最清晰的红黑树讲解（上） 
https://www.cnblogs.com/CarpenterLee/p/5503882.html

史上最清晰的红黑树讲解（下） 
https://www.cnblogs.com/CarpenterLee/p/5525688.html...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题32：从上到下打印二叉树》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/81775524</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/81775524</guid><author>u011296723</author><pubDate>Fri, 17 Aug 2018 12:14:28 +0800</pubDate><description><![CDATA[《剑指offer—面试题32：从上到下打印二叉树》  
注明：仅个人学习笔记

方法一：—————————————————————————–

import java.util.ArrayList;

/** 
 *  
 *  
 *         从上到下打印树节点，层序遍历 
 * 
 */ 
public class FromTopToEndPrintTree32 
{ 
    pub...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题31：栈的压入、弹出序列》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/81773602</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/81773602</guid><author>u011296723</author><pubDate>Fri, 17 Aug 2018 10:36:26 +0800</pubDate><description><![CDATA[《剑指offer—面试题31：栈的压入、弹出序列》  
注明：仅个人学习笔记

import java.util.Stack;

public class IsPopOrder31 
{ 
    public static boolean IsPopOrder(int[] pushA, int[] popA) 
    { 
        if (pushA == null || popA =...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题30：包含main函数的栈》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/81772450</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/81772450</guid><author>u011296723</author><pubDate>Fri, 17 Aug 2018 09:38:30 +0800</pubDate><description><![CDATA[《剑指offer—面试题30：包含main函数的栈》  
注明：仅个人学习笔记

import java.util.Stack;

public class FindStackMin30 
{

Stack&amp;lt;Integer&amp;gt; dataStack = new Stack&amp;lt;Integer&amp;gt;();
Stack&amp;lt;Integer&amp;gt; minStack = new Stack...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题29：顺时针打印矩阵》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/81750002</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/81750002</guid><author>u011296723</author><pubDate>Thu, 16 Aug 2018 22:26:52 +0800</pubDate><description><![CDATA[《剑指offer—面试题29：顺时针打印矩阵》  
注明：仅个人学习笔记 
参考文献： 
【1】https://blog.youkuaiyun.com/lilianforever/article/details/51848885 
【2】http://wiki.jikexueyuan.com/project/for-offer/question-twenty.html

import java.util.Ar...]]></description><category></category></item><item><title><![CDATA[《剑指offer—面试题28：对称的二叉树》]]></title><link>https://blog.youkuaiyun.com/u011296723/article/details/81739120</link><guid>https://blog.youkuaiyun.com/u011296723/article/details/81739120</guid><author>u011296723</author><pubDate>Thu, 16 Aug 2018 11:58:07 +0800</pubDate><description><![CDATA[《剑指offer—面试题28：对称的二叉树》  
注明：仅个人学习笔记

先序遍历的序列 等于 对称先序遍历的序列 
当树中所有节点均相同时，遍历时，序列中带入null，便可区分

package com.chapter3.code;

public class IsSymmetrical28 
{ 
    boolean isSymmetrical(TreeNode root) 
    {
...]]></description><category></category></item></channel></rss>