<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[returnzhang的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/returnzhang</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; returnzhang]]></copyright><item><title><![CDATA[springboot打包entityManagerFactory报错 以及运行jar出现的java.lang.NoClassDefFoundError:javax/xml/bind/JAXBExcep]]></title><link>https://blog.youkuaiyun.com/returnzhang/article/details/80864896</link><guid>https://blog.youkuaiyun.com/returnzhang/article/details/80864896</guid><author>returnzhang</author><pubDate>Sat, 30 Jun 2018 11:02:15 +0800</pubDate><description><![CDATA[今天打包一个springboot的小demo 出现了一些问题

entityManagerFactory报错

org.springframework.beans.factory.BeanCreationException: Error creating bean with name ‘entityManagerFactory’ defined in class path resource [or...]]></description><category></category></item><item><title><![CDATA[Javaee 学习记录（1）]]></title><link>https://blog.youkuaiyun.com/returnzhang/article/details/80098240</link><guid>https://blog.youkuaiyun.com/returnzhang/article/details/80098240</guid><author>returnzhang</author><pubDate>Thu, 26 Apr 2018 19:47:12 +0800</pubDate><description><![CDATA[一：C/S结构和B/S结构    a：c/s结构(客户端-服务端模型),应用放在客户端，通过网络与服务端进行交互。            优点：本地响应速度快，界面美观，方便               缺点：应用发布，维护麻烦，成本高    b：b/s结构(浏览器-服务器模型),应用放在服务器本地，客户端只需安装浏览器即可使用。            优点：发布，维护成本小，开发相对较简单   ...]]></description><category></category></item><item><title><![CDATA[用递归反转栈（Java实现]]></title><link>https://blog.youkuaiyun.com/returnzhang/article/details/78609011</link><guid>https://blog.youkuaiyun.com/returnzhang/article/details/78609011</guid><author>returnzhang</author><pubDate>Wed, 22 Nov 2017 22:19:22 +0800</pubDate><description><![CDATA[用递归来反转栈
最开始的想法是一个递归函数解决，然后仔细想想不行
解法：
一个递归函数返回栈的栈底元素并将之移除
另一个递归函数进行递归压入得到的数据
代码：

/**
 * By  returnZhang
 * 两个队列组成栈
 * stackIn   压入数据
 * stackOut 反转数据
 */
public class StackToList {

    Stack s]]></description><category></category></item><item><title><![CDATA[用栈实现队列的先进先出结构]]></title><link>https://blog.youkuaiyun.com/returnzhang/article/details/78608989</link><guid>https://blog.youkuaiyun.com/returnzhang/article/details/78608989</guid><author>returnzhang</author><pubDate>Wed, 22 Nov 2017 22:12:17 +0800</pubDate><description><![CDATA[**
 * By  returnZhang
 * 两个队列组成栈
 * stackIn   压入数据
 * stackOut 反转数据
 */
public class StackToList {

    Stack stackIn;//数据栈
    Stack stackOut;//反转栈

    public StackToList(){
        stackIn=new Stac]]></description><category></category></item><item><title><![CDATA[最小栈（Java实现）]]></title><link>https://blog.youkuaiyun.com/returnzhang/article/details/78608898</link><guid>https://blog.youkuaiyun.com/returnzhang/article/details/78608898</guid><author>returnzhang</author><pubDate>Wed, 22 Nov 2017 22:07:18 +0800</pubDate><description><![CDATA[/**
 * By  returnZhang
 * 用栈实现最小栈（获取栈中最小值）
 * 数据栈 stackData
 * 栈中最小数据 stackMin
 */
public class MinStack {

    private Stack stackData;//数据栈
    private Stack stackMin;//保存当前最小数的栈（称最小栈
    //构造函数
  ]]></description><category></category></item><item><title><![CDATA[Caused by: java.lang.NoClassDefFoundError: Lorg/apache/logging/log4j/Logger]]></title><link>https://blog.youkuaiyun.com/returnzhang/article/details/78608597</link><guid>https://blog.youkuaiyun.com/returnzhang/article/details/78608597</guid><author>returnzhang</author><pubDate>Wed, 22 Nov 2017 21:37:00 +0800</pubDate><description><![CDATA[org.apache.catalina.LifecycleException: Failed to start component [StandardEngine[Catalina].StandardHost[localhost].StandardContext[/spring_demo_2]]
at org.apache.catalina.util.LifecycleBase.start(Li]]></description><category></category></item><item><title><![CDATA[快速排序]]></title><link>https://blog.youkuaiyun.com/returnzhang/article/details/61614396</link><guid>https://blog.youkuaiyun.com/returnzhang/article/details/61614396</guid><author>returnzhang</author><pubDate>Sun, 12 Mar 2017 09:23:56 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;




void quickSort(vector &a,int left,int right){
    if(left>right) return;//递归判定，结束条件
    int key=a[left];//基准数
    int i=left;
    int j=right;
  ]]></description><category></category></item></channel></rss>