<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[SkyTwx]]></title><description><![CDATA[有道而无术，术尚可求；有术无道，止于术]]></description><link>https://blog.youkuaiyun.com/u010013140</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u010013140]]></copyright><item><title><![CDATA[【无标题】Spring中FactoryBean的作用和实现原理]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/123356061</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/123356061</guid><author>u010013140</author><pubDate>Tue, 08 Mar 2022 16:01:01 +0800</pubDate><description><![CDATA[BeanFactory与FactoryBean，相信很多刚翻看Spring源码的同学跟我一样很好奇这俩货怎么长得这么像，分别都是干啥用的。BeanFactory是Spring中Bean工厂的顶层接口，也是我们常说的SpringIOC容器，它定下了IOC容器的一些规范和常用方法并管理着Spring中所有的Bean，今天我们不讲它，我们看一下后面那个FactoryBean。

先说下FactoryBean和其作用再开始分析：首先它是一个Bean，但又不仅仅是一个Bean。它是一个能生产或修饰对象生成的工厂Bea]]></description><category></category></item><item><title><![CDATA[网上商城JaChart生成报表、发送短信和邮件功能]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/78067459</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/78067459</guid><author>u010013140</author><pubDate>Fri, 22 Sep 2017 22:11:33 +0800</pubDate><description><![CDATA[JsChart显示后台信息：首先前台jsp页面发送一个Ajax请求，然后后台从数据库中取出相应的数据，这里的数据我们只需要取出卖了哪些商品以及相应的卖出数量即可，也就是说我们得从订单项的表中取，另外，前台还得传过去一个参数，告诉后台取多少条数据。后台取好了后将数据以json的格式发送到前台，前台再运行上面的js代码（当然要做相应的修改）将数据显示成报表的形式。Post方式发送请求：第一个参数是要发]]></description><category></category></item><item><title><![CDATA[剑指Offer----二叉搜索树的后序遍历序列]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76034646</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76034646</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 19:17:30 +0800</pubDate><description><![CDATA[输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No假设输入的数组的任意两个数字都互不相同。
import java.util.Arrays;
public class Solution {
    public boolean VerifySquenceOfBST(int [] sequence) {
        if(sequence==nul]]></description><category></category></item><item><title><![CDATA[剑指Offer----从上往下打印二叉树]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76034112</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76034112</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 18:07:28 +0800</pubDate><description><![CDATA[从上往下打印出二叉树的每个节点，同层节点从左至右打印。
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right ]]></description><category></category></item><item><title><![CDATA[剑指Offer----栈的压入、弹出序列]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76034031</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76034031</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 18:01:41 +0800</pubDate><description><![CDATA[输入两个整数序列，第一个序列表示栈的压入顺序，请判断第二个序列是否为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序，序列4，5,3,2,1是该压栈序列对应的一个弹出序列，但4,3,5,1,2就不可能是该压栈序列的弹出序列。（注意：这两个序列的长度是相等的）
import java.util.Stack;
public class Solution {]]></description><category></category></item><item><title><![CDATA[剑指Offer----包含min函数的栈]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76033976</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76033976</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 17:56:01 +0800</pubDate><description><![CDATA[定义栈的数据结构，请在该类型中实现一个能够得到栈最小元素的min函数。
import java.util.Stack;
public class Solution {
 Stack data = new Stack();
    Stack min = new Stack();
    Integer temp = null;
    public void push(int node) {
 ]]></description><category></category></item><item><title><![CDATA[剑指Offer----顺时针打印矩阵]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76033876</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76033876</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 17:49:16 +0800</pubDate><description><![CDATA[输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字，例如，如果输入如下矩阵： 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 则依次打印出数字1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10.
import java.util.ArrayList;
public class Solution {
    public Array]]></description><category></category></item><item><title><![CDATA[剑指Offer----二叉树的镜像]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76033780</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76033780</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 17:44:06 +0800</pubDate><description><![CDATA[操作给定的二叉树，将其变换为源二叉树的镜像。
/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
    public TreeNode(int val) {
        this.val = val;
    }
}
*/
import java.]]></description><category></category></item><item><title><![CDATA[剑指Offer----树的子结构]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76033696</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76033696</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 17:36:21 +0800</pubDate><description><![CDATA[输入两棵二叉树A，B，判断B是不是A的子结构。（ps：我们约定空树不是任意一个树的子结构）
/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
    public TreeNode(int val) {
        this.val = val;
]]></description><category></category></item><item><title><![CDATA[剑指Offer----合并两个排序的链表]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76033229</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76033229</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 17:29:42 +0800</pubDate><description><![CDATA[输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。
/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
   ]]></description><category></category></item><item><title><![CDATA[剑指Offer----反转链表]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76033105</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76033105</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 17:24:57 +0800</pubDate><description><![CDATA[输入一个链表，反转链表后，输出链表的所有元素。
/*
public class ListNode {
    int val;
    ListNode next = null;


    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public Lis]]></description><category></category></item><item><title><![CDATA[剑指Offer----链表中倒数第k个节点]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/76030534</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/76030534</guid><author>u010013140</author><pubDate>Mon, 24 Jul 2017 17:03:54 +0800</pubDate><description><![CDATA[输入一个链表，输出该链表中倒数第k个结点。
/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode FindKthT]]></description><category></category></item><item><title><![CDATA[剑指Offer----调整数组顺序使奇数位于偶数前面]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/75092340</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/75092340</guid><author>u010013140</author><pubDate>Thu, 13 Jul 2017 20:43:41 +0800</pubDate><description><![CDATA[输入一个整数数组，实现一个函数来调整该数组中数字的顺序，使得所有的奇数位于数组的前半部分，所有的偶数位于位于数组的后半部分，并保证奇数和奇数，偶数和偶数之间的相对位置不变。
解析：如果仅考虑奇数放在偶数前面，不考虑奇数和奇数，偶数和偶数之间的相对位置不变的话，可以用以下代码：
public class Solution {
    public void reOrderArray(int []]]></description><category></category></item><item><title><![CDATA[剑指Offer----数值的整数次方]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/75035973</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/75035973</guid><author>u010013140</author><pubDate>Wed, 12 Jul 2017 17:32:05 +0800</pubDate><description><![CDATA[给定一个double类型的浮点数base和int类型的整数exponent。求base的exponent次方。
解题思路：注意次方为负数和0的情况
代码一：
public class Solution {
    public double Power(double base, int exponent) {
        double result=1.0;
        if(exp]]></description><category></category></item><item><title><![CDATA[剑指Offer----二进制中1的个数]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/75016961</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/75016961</guid><author>u010013140</author><pubDate>Wed, 12 Jul 2017 15:19:48 +0800</pubDate><description><![CDATA[输入一个整数，输出该数二进制表示中1的个数。其中负数用补码表示。
错误解法：
public class Solution {
    public int NumberOf1(int n) {
        int num=0;
        while(n!=0){
            if((n&1)==1)num++;
            n=n>>1;
        }
]]></description><category></category></item><item><title><![CDATA[剑指Offer----重建二叉树]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/74908875</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/74908875</guid><author>u010013140</author><pubDate>Mon, 10 Jul 2017 09:47:46 +0800</pubDate><description><![CDATA[输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。
/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 * ]]></description><category></category></item><item><title><![CDATA[剑指Offer----矩形覆盖]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/74906143</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/74906143</guid><author>u010013140</author><pubDate>Sun, 09 Jul 2017 21:19:56 +0800</pubDate><description><![CDATA[我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形，总共有多少种方法？
解题思路：1.递归
public class Solution {
    public int RectCover(int target) {
         if(target==0)return 0;
         if(target==1)return]]></description><category></category></item><item><title><![CDATA[剑指Offer----变态跳台阶]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/74906121</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/74906121</guid><author>u010013140</author><pubDate>Sun, 09 Jul 2017 21:17:07 +0800</pubDate><description><![CDATA[一只青蛙一次可以跳上1级台阶，也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
解题思路：根据数学归纳法可以得到F（n）=2*2*2...*2；（n-1个2）
public class Solution {
    public int JumpFloorII(int target) {
            if (target <= 0) {
      ]]></description><category></category></item><item><title><![CDATA[剑指Offer----跳台阶]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/74906013</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/74906013</guid><author>u010013140</author><pubDate>Sun, 09 Jul 2017 21:02:25 +0800</pubDate><description><![CDATA[一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
解题思路：1.斐波那契数列
public class Solution {
    public int JumpFloor(int target) {
       if(target==1)return 1;
       if(target==2)return 2;
       return J]]></description><category></category></item><item><title><![CDATA[剑指Offer----斐波那契数列]]></title><link>https://blog.youkuaiyun.com/u010013140/article/details/74905965</link><guid>https://blog.youkuaiyun.com/u010013140/article/details/74905965</guid><author>u010013140</author><pubDate>Sun, 09 Jul 2017 20:56:42 +0800</pubDate><description><![CDATA[大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项。n
解题思路：1.递归
public class Solution {
    public int Fibonacci(int n) {
         if(n<=0)return 0;
        if(n==1)return 1;
        return Fibonacci(n-1)+Fibona]]></description><category></category></item></channel></rss>