<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Mr.王同学]]></title><description><![CDATA[递归虐我千百遍，我待递归如初见]]></description><link>https://blog.youkuaiyun.com/qq_33736809</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_33736809]]></copyright><item><title><![CDATA[计算机考研复试常见面试题汇总：数据结构+操作系统+计网+数据库]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/115244066</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/115244066</guid><author>qq_33736809</author><pubDate>Fri, 26 Mar 2021 14:50:34 +0800</pubDate><description><![CDATA[数据结构

时间复杂度
	循环队列的顺序表中，为什么要空一个位置？
	什么是二叉排序树？以及它的原理，算法。（二叉排序树的查找过程）
	哈夫曼树
	什么是哈希冲突？以及如何解决。
	深度优先搜索遍历和广度优先搜索遍历的过程
	迪杰斯特拉算法的过程
	链表查找某个元素，平均的时间复杂度是多少？
	图的存储方式
	图的深度遍历是否唯一
	图的相关概念
	最小生成树的概念
	平衡二叉树
	红黑树
	二叉树的存储
	M 阶 B- 树和 M 阶 B+ 树的主要区别 
	折半查找，以及其适用范围和时间复杂度
	完全二.]]></description><category></category></item><item><title><![CDATA[Encountered a duplicated sql alias [id] during auto-discovery of a native-sql query异常]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/102729182</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/102729182</guid><author>qq_33736809</author><pubDate>Thu, 24 Oct 2019 18:32:57 +0800</pubDate><description><![CDATA[通常是因为在关联查询时，用了select*，而*中几张表的id字段冲突，所以导致异常。
]]></description><category></category></item><item><title><![CDATA[缓存与数据库 数据不一致分析]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/99692010</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/99692010</guid><author>qq_33736809</author><pubDate>Sat, 17 Aug 2019 13:37:23 +0800</pubDate><description><![CDATA[1.最初级的缓存不一致问题以及解决方案

问题场景：先修改数据库，再删除缓存，如果缓存删除失败，那么会导致数据库中是新数据，缓存中是旧数据，数据出现不一致!


最初级的数据库+缓存双写不一致问题


解决:先删除缓存，再修改数据库，如果删除缓存成功了，如果修改数据库失败了，那么数据库中是旧数据，缓存中是空的，那么数据不会不一致

读的时候缓存没有，则读数据库中旧数据，然后更新到缓存中

2.比较...]]></description><category></category></item><item><title><![CDATA[【ubuntu】心态崩了，误删了/usr目录。。]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/98614770</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/98614770</guid><author>qq_33736809</author><pubDate>Tue, 06 Aug 2019 14:22:54 +0800</pubDate><description><![CDATA[装的双系统一下变成单系统，怀疑人生了。。。

]]></description><category></category></item><item><title><![CDATA[【eclipse】eclipse安装spring插件失败 报错no software site found at]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/98611933</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/98611933</guid><author>qq_33736809</author><pubDate>Tue, 06 Aug 2019 14:04:06 +0800</pubDate><description><![CDATA[不要去官网下载win版本的！直接改动下面url标红的版本号就可以（updatesite.zip结尾）




http://download.springsource.com/release/TOOLS/update/3.9.1.RELEASE/e4.7/springsource-tool-suite-3.9.1.RELEASE-e4.7.1a-updatesite.zip

...]]></description><category></category></item><item><title><![CDATA[【转】Hibernate框架的总结]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/90549824</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/90549824</guid><author>qq_33736809</author><pubDate>Sat, 25 May 2019 18:15:45 +0800</pubDate><description><![CDATA[Hibernate框架的总结

hibernate 简介：
hibernate是一个开源框架，它是对象关联关系映射的框架，它对JDBC做了轻量级的封装，而我们java程序员可以使用面向对象的思想来操纵数据库。hibernate核心接口
session：负责被持久化对象CRUD操作
sessionFactory:负责初始化hibernate，创建session对象
configuration:负责配...]]></description><category></category></item><item><title><![CDATA[【hibernate】单元测试通过，控制台报错：hibernate.hbm2ddl.auto update报错Table doesn‘t exist]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/90316845</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/90316845</guid><author>qq_33736809</author><pubDate>Sat, 18 May 2019 16:30:32 +0800</pubDate><description><![CDATA[情景重现：

新增实体类，数据库中无此表，映射、配置文件均配置完成。



刚开始报错：Could not get constructor for org.hibernate.persister.entity.SingleTableEntityPersister，查找到解决方案：将实体类中get、set方法全部重新生成，成功解决。

后来单元测试通过，控制台报错：





异常显示表不存在，可...]]></description><category></category></item><item><title><![CDATA[hibernate连接接数据库报错]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/90085108</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/90085108</guid><author>qq_33736809</author><pubDate>Sat, 11 May 2019 21:14:47 +0800</pubDate><description><![CDATA[org.hibernate.service.spi.ServiceException: Unable to create requested service

[org.hibernate.engine.jdbc.env.spi.JdbcEnvironment]

错误详情：




&lt;property name="hibernate.connection.driver_class"&gt;...]]></description><category></category></item><item><title><![CDATA[关于SpringMVC的一些面试题]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/88708264</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/88708264</guid><author>qq_33736809</author><pubDate>Thu, 21 Mar 2019 10:22:25 +0800</pubDate><description><![CDATA[1、什么是Spring MVC ？简单介绍下你对springMVC的理解?

SpringMVC是一个基于MVC架构的用来简化web应用程序开发的应用开发框架，它是Spring的一个模块,无需中间整合层来整合，它和Struts2一样都属于表现层的框架。在web模型中，MVC是一种很流行的框架，通过把Model，View，Controller分离，把较为复杂的web应用分成逻辑清晰的几部分，简化...]]></description><category></category></item><item><title><![CDATA[【排序算法】归并排序（再记不住我就去死）]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/88541654</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/88541654</guid><author>qq_33736809</author><pubDate>Wed, 13 Mar 2019 21:26:55 +0800</pubDate><description><![CDATA[归并排序（归，递归；并，合并；可以理解为这两个过程）




			平均时间复杂度
			最好情况
			最坏情况
			空间复杂度
		归并排序
			O(log₂n)
			O(log₂n)
			O(log₂n)
			O(1)
		

算法思想：先将整个序列分为两半，对每一半分别进行归并排序，将得到两个有序序列，然后将这两个序列归并成一个序列即可。


/**
 *归并排序:归并分开...]]></description><category></category></item><item><title><![CDATA[【LeetCode】Min Stack（最小栈）]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79503655</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79503655</guid><author>qq_33736809</author><pubDate>Fri, 09 Mar 2018 23:00:56 +0800</pubDate><description><![CDATA[【LeetCode】Min Stack（最小栈）题目链接：https://leetcode.com/problems/min-stack/description/难度：Easy题目描述：Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) --...]]></description><category></category></item><item><title><![CDATA[【LeetCode】206. Reverse Linked List（倒置链表）]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79442922</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79442922</guid><author>qq_33736809</author><pubDate>Mon, 05 Mar 2018 15:34:34 +0800</pubDate><description><![CDATA[【LeetCode】206. Reverse Linked List（倒置链表）题目链接：https://leetcode.com/problems/reverse-linked-list/description/难度：Easy题目描述：Reverse a singly linked list.click to show more hints.倒置单链表，例如1-&amp;gt;2-&amp;gt;3-&amp;gt;4...]]></description><category></category></item><item><title><![CDATA[【排序算法】快速排序]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79426733</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79426733</guid><author>qq_33736809</author><pubDate>Fri, 02 Mar 2018 21:01:00 +0800</pubDate><description><![CDATA[【排序算法】快速排序排序算法平均时间复杂度冒泡排序O(n2)选择排序O(n2)插入排序O(n2)希尔排序O(n1.5)快速排序O(N*logN)归并排序O(N*logN)堆排序O(N*logN)基数排序O(d(n+r))快速排序：时间复杂度：O(nlogn)快速排序是对冒泡排序的一种改进，采用分治的策略，其基本思想：1.先从数列中取出一个数作为基准数；2.将比这个数大的全放在右边，小于等于它的全放...]]></description><category></category></item><item><title><![CDATA[【剑指Offer】008 青蛙跳台阶]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79401611</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79401611</guid><author>qq_33736809</author><pubDate>Wed, 28 Feb 2018 16:05:43 +0800</pubDate><description><![CDATA[【剑指Offer】008 青蛙跳台阶



题目链接：剑指Offer 第八题  牛客网

题目描述：

一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法

思路：同斐波那契数列

首先找规律，当n=1，有一种跳法（不可以跳过头哦）；当n=2，有两种跳法（1+1或2）；当n=3，有三种跳法（1+1+1或1+2或2+1）；同理，当n=4，有五种跳法；n...]]></description><category></category></item><item><title><![CDATA[【剑指Offer】007 斐波那契数列]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79394465</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79394465</guid><author>qq_33736809</author><pubDate>Tue, 27 Feb 2018 23:20:27 +0800</pubDate><description><![CDATA[【剑指Offer】007 斐波那契数列题目链接：剑指Offer 第七题 牛客网题目描述：大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项。n&amp;lt;=39思路：斐波那契数列定义：相信很多学过递归的同学都知道斐波那契数列，是作为学习递归的重要例子，但是很多时候我们用递归并没有使我们的算法更简化，或者说过滤出一些无用解，使算法更优化；换句话说，如果我们使用的递归并没有使我们...]]></description><category></category></item><item><title><![CDATA[【LeetCode】Best Time to Buy and Sell Stock（买卖股票的最佳时间）]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79393764</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79393764</guid><author>qq_33736809</author><pubDate>Tue, 27 Feb 2018 22:24:04 +0800</pubDate><description><![CDATA[【LeetCode】Best Time to Buy and Sell Stock（买卖股票的最佳时间）题目链接：https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/难度：Easy题目描述：Say you have an array for which the ith element is the pr...]]></description><category></category></item><item><title><![CDATA[【LeetCode】717. 1-bit and 2-bit Characters（一位数和两位数）]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79365681</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79365681</guid><author>qq_33736809</author><pubDate>Sat, 24 Feb 2018 22:02:41 +0800</pubDate><description><![CDATA[【LeetCode】717. 1-bit and 2-bit Characters（一位数和两位数）题目链接：https://leetcode.com/problems/1-bit-and-2-bit-characters/description/难度：Easy题目描述：We have two special characters. The first character can be repre...]]></description><category></category></item><item><title><![CDATA[【LeetCode】448. Find All Numbers Disappeared in an Array（找到数组中消失的元素）]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79360611</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79360611</guid><author>qq_33736809</author><pubDate>Sat, 24 Feb 2018 12:49:00 +0800</pubDate><description><![CDATA[【LeetCode】448. Find All Numbers Disappeared in an Array（找到数组中消失的元素）题目链接：https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/description/难度：Easy题目描述：Given an array of integers where ...]]></description><category></category></item><item><title><![CDATA[【LeetCode】283. Move Zeroes（移动零）]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79357886</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79357886</guid><author>qq_33736809</author><pubDate>Sat, 24 Feb 2018 00:13:10 +0800</pubDate><description><![CDATA[【LeetCode】283. Move Zeroes（移动零）题目链接：https://leetcode.com/problems/move-zeroes/description/难度：Easy问题描述：Given an array nums, write a function to move all 0's to the end of it while maintaining the relat...]]></description><category></category></item><item><title><![CDATA[【LeetCode】695. Max Area of Island（岛的最大面积）]]></title><link>https://blog.youkuaiyun.com/qq_33736809/article/details/79357596</link><guid>https://blog.youkuaiyun.com/qq_33736809/article/details/79357596</guid><author>qq_33736809</author><pubDate>Fri, 23 Feb 2018 23:01:41 +0800</pubDate><description><![CDATA[【LeetCode】695. Max Area of Island（岛的最大面积）题目链接：https://leetcode.com/problems/max-area-of-island/description/难度：Easy题目描述：Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (repr...]]></description><category></category></item></channel></rss>