<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Simma1101的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Simma1101</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Simma1101]]></copyright><item><title><![CDATA[商业模式]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581099</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581099</guid><author>Simma1101</author><pubDate>Tue, 10 Sep 2019 20:01:00 +0800</pubDate><description><![CDATA[转载于:https://www.cnblogs.com/PureJava/p/11502564.html]]></description><category></category></item><item><title><![CDATA[知乎_产品结构图]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581098</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581098</guid><author>Simma1101</author><pubDate>Tue, 23 Jul 2019 15:38:00 +0800</pubDate><description><![CDATA[转载于:https://www.cnblogs.com/PureJava/p/11232145.html]]></description><category></category></item><item><title><![CDATA[Intellij中request等对象无法解析]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581097</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581097</guid><author>Simma1101</author><pubDate>Wed, 17 Apr 2019 22:42:00 +0800</pubDate><description><![CDATA[问题描述
刚刚从eclipse转过来IDEA开发Java web，发现创建项目之后跟eclipse不一样，jsp内置对象统统都不能代码提示或者自动补全。甚至出现内置对象 Cannot resolve method ‘print(int)'报错
原理
这是没有解决依赖包的原因，所以解决方法就是把依赖包添加进去
解决方法

打开 File-&gt;Project Stru...]]></description><category></category></item><item><title><![CDATA[OneNote学习笔记----语言概述]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581094</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581094</guid><author>Simma1101</author><pubDate>Fri, 12 Apr 2019 13:46:00 +0800</pubDate><description><![CDATA[1.软件 ： 系统软件  vs  应用软件
2.人与计算机做交互：使用计算机语言。
		图形化界面  vs  命令行方式  dir  md rd  cd  cd..  cd/  del  exit	
3.语言的分类：第一代：机器语言  第二代：汇编语言  第三代：高级语言（面向过程  --- 面向对象）
4.java语言的特性：①面向对象性 ②健壮性 ③跨平台性（write on...]]></description><category></category></item><item><title><![CDATA[四、归并排序（mergesort）]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581092</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581092</guid><author>Simma1101</author><pubDate>Thu, 28 Mar 2019 21:15:00 +0800</pubDate><description><![CDATA[最坏情况的时间复杂度：O(N log N)
归并排序是稳定排序，它也是一种十分高效的排序，能利用完全二叉树特性的排序一般性能都不会太差 。java中Arrays.sort()采用了一种名为TimSort的排序算法，就是归并排序的优化版本。从上文的图中可看出，每次合并操作的平均时间复杂度为O(n)，而完全二叉树的深度为|log2n|。总的平均时间复杂度为O(nlogn)。而且，归并排...]]></description><category></category></item><item><title><![CDATA[三、堆排序(Heapsort)，优先队列可以用于O(N log N)]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581095</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581095</guid><author>Simma1101</author><pubDate>Mon, 25 Mar 2019 09:53:00 +0800</pubDate><description><![CDATA[三、堆排序(Heapsort)
优先队列可以用于O(N log N)
存储空间增加一倍




排序类别


排序方法


时间复杂度


时间复


杂度


空间复杂度


稳定性


复杂性










平均情况


最坏情况


最好情况








...]]></description><category></category></item><item><title><![CDATA[二、希尔排序（Shellsort）-- 缩减增量排序（diminishing increment sort）]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581090</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581090</guid><author>Simma1101</author><pubDate>Sun, 24 Mar 2019 21:32:00 +0800</pubDate><description><![CDATA[• 最坏情况下运行时间为 Θ(N2),此时为Hibbard增量( 希尔排序是把记录按下标的一定增量分组，对每组使用直接插入排序算法排序；随着增量逐渐减少，每组包含的关键词越来越多，当增量减至1时，整个文件恰被分成一组，算法便终止。 简单插入排序很循规蹈矩，不管数组分布是怎么样的，依然一步一步的对元素进行比较，移动，插入，比如[5,4,3,2,1,0]这种倒序序列，数...]]></description><category></category></item><item><title><![CDATA[一、插入排序(insertion sort)]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581093</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581093</guid><author>Simma1101</author><pubDate>Sun, 24 Mar 2019 21:29:00 +0800</pubDate><description><![CDATA[Public class InsertionSort{
        Public static&lt;AnyType extends Comparable&lt;? Super AnyType&gt;&gt; AnyType[] insertionSort(AnyType[]a){
            intj;
            for(intp=...]]></description><category></category></item><item><title><![CDATA[hashmap冲突的解决方法以及原理分析：]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581088</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581088</guid><author>Simma1101</author><pubDate>Wed, 20 Mar 2019 12:42:00 +0800</pubDate><description><![CDATA[在Java编程语言中，最基本的结构就是两种，一种是数组，一种是模拟指针(引用),所有的数据结构都可以用这两个基本结构构造，HashMap也一样。当程序试图将多个 key-value 放入 HashMap 中时，以如下代码片段为例：


HashMap&lt;String,Object&gt; m=new HashMap&lt;String,Object&gt;();m.put("...]]></description><category></category></item><item><title><![CDATA[sudoku计算]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581087</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581087</guid><author>Simma1101</author><pubDate>Sat, 16 Mar 2019 09:39:00 +0800</pubDate><description><![CDATA[数独是一个我们都非常熟悉的经典游戏，运用计算机我们可以很快地解开数独难题，现在有一些简单的数独题目，请编写一个程序求解。输入描述:输入9行，每行为空格隔开的9个数字，为0的地方就是需要填充的。输出描述:输出九行，每行九个空格隔开的数字，为解出的答案。分析：    这里的数独就是9行9列的数组，满足每一行、每一列、每一个宫内的数字均含1-9，不重复。    解题思路：DFS深度填数检测+回...]]></description><category></category></item><item><title><![CDATA[MAP按照value排序]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581056</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581056</guid><author>Simma1101</author><pubDate>Tue, 12 Mar 2019 19:57:00 +0800</pubDate><description><![CDATA[import java.util.Collections;import java.util.Comparator;import java.util.LinkedHashMap;import java.util.LinkedList;import java.util.List;import java.util.Map;import java.util.TreeMap;
public cl...]]></description><category></category></item><item><title><![CDATA[Map遍历四种方法]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581055</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581055</guid><author>Simma1101</author><pubDate>Tue, 12 Mar 2019 19:50:00 +0800</pubDate><description><![CDATA[转载：http://www.cnblogs.com/kristain/articles/2033566.html
public static void main(String[] args) {
Map&lt;String, String&gt; map = new HashMap&lt;String, String&gt;();map.put("1", "value1");...]]></description><category></category></item><item><title><![CDATA[Java native方法]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581054</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581054</guid><author>Simma1101</author><pubDate>Sat, 09 Mar 2019 22:19:00 +0800</pubDate><description><![CDATA[附有连接（https://www.cnblogs.com/jingmoxukong/p/4302891.html），其中很多是引用其他作者，主要是自己学习随笔，如果有问题，请与我联系，万分感谢！


转载于:https://www.cnblogs.com/PureJava/p/10503409.html...]]></description><category></category></item><item><title><![CDATA[[PAT] 1143 Lowest Common Ancestor （30 分）Java]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581053</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581053</guid><author>Simma1101</author><pubDate>Fri, 08 Mar 2019 21:02:00 +0800</pubDate><description><![CDATA[The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.
A binary search tree (BST) is recursively defined as a binary tree which...]]></description><category></category></item><item><title><![CDATA[[PAT] 1148 Werewolf - Simple Version （20 分）Java]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581052</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581052</guid><author>Simma1101</author><pubDate>Fri, 08 Mar 2019 21:02:00 +0800</pubDate><description><![CDATA[Werewolf（狼人杀） is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game,

player #1 said: "Player #2 is a werewolf.";
playe...]]></description><category></category></item><item><title><![CDATA[[PAT] 1096 Consecutive Factors （20 分）Java]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581051</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581051</guid><author>Simma1101</author><pubDate>Fri, 08 Mar 2019 21:00:00 +0800</pubDate><description><![CDATA[Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3×\times×5×\times×6×\times×7, where 5, 6, and 7 are the three...]]></description><category></category></item><item><title><![CDATA[[PAT] 1092 To Buy or Not to Buy （20 分）Java]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581050</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581050</guid><author>Simma1101</author><pubDate>Fri, 08 Mar 2019 20:58:00 +0800</pubDate><description><![CDATA[Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would onl...]]></description><category></category></item><item><title><![CDATA[[PAT] 1088 Rational Arithmetic （20 分）Java]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581049</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581049</guid><author>Simma1101</author><pubDate>Fri, 08 Mar 2019 20:57:00 +0800</pubDate><description><![CDATA[For two rational numbers, your task is to implement the basic arithmetics, that is, to calculate their sum, difference, product and quotient.
Input Specification:
Each input file contains one t...]]></description><category></category></item><item><title><![CDATA[[PAT] 1084 Broken Keyboard （20 分）Java]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581048</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581048</guid><author>Simma1101</author><pubDate>Fri, 08 Mar 2019 20:54:00 +0800</pubDate><description><![CDATA[On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on screen.
Now given a string that you are suppos...]]></description><category></category></item><item><title><![CDATA[[PAT] 1081 Rational Sum （20 分）Java]]></title><link>https://blog.youkuaiyun.com/Simma1101/article/details/101581091</link><guid>https://blog.youkuaiyun.com/Simma1101/article/details/101581091</guid><author>Simma1101</author><pubDate>Fri, 08 Mar 2019 20:42:00 +0800</pubDate><description><![CDATA[Given N rational numbers in the form numerator/denominator, you are supposed to calculate their sum.
Input Specification:
Each input file contains one test case. Each case starts with a positiv...]]></description><category></category></item></channel></rss>