<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Autii's blog]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Autii</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Autii]]></copyright><item><title><![CDATA[Netty（一）Netty简介与Java的IO模型]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/134164527</link><guid>https://blog.youkuaiyun.com/Autii/article/details/134164527</guid><author>Autii</author><pubDate>Wed, 01 Nov 2023 16:31:37 +0800</pubDate><description><![CDATA[​	Netty是由JBOSS提供的一个Java开源框架，现为Github上的独立项目。Netty是一个异步的、基于事件驱动的网络应用框架，用以快速开发高性能、高可靠性的网络IO程序Netty主要针对在TCP环境下，面向Clients端的高并发应用，或者P2P场景下的大量数据持续传输的应用Netty的本质是一个NIO框架，适用于服务器通讯相关的多种应用场景Netty框架基于TCP/IP协议，在原生的JDK IO、网络的基础上使用NIO对IO、网络进行的封装优化的框架。]]></description><category></category></item><item><title><![CDATA[数据结构实验之查找三：树的种类统计]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/90412406</link><guid>https://blog.youkuaiyun.com/Autii/article/details/90412406</guid><author>Autii</author><pubDate>Tue, 21 May 2019 18:19:15 +0800</pubDate><description><![CDATA[数据结构实验之查找三：树的种类统计
#include &lt;iostream&gt;
#include &lt;cstring&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
using 

namespace std;
struct tree {
    int cou;
    char a[20+5];
    tree *l,...]]></description><category></category></item><item><title><![CDATA[JAVA获取网页源码并写入html文件]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/78687438</link><guid>https://blog.youkuaiyun.com/Autii/article/details/78687438</guid><author>Autii</author><pubDate>Fri, 01 Dec 2017 15:45:30 +0800</pubDate><description><![CDATA[package pac;

import java.io.*;
import java.net.HttpURLConnection;
import java.net.URL;

public class Main {

	public static class HttpTest {
		private String u;
		private String encoding;

		HttpTest]]></description><category></category></item><item><title><![CDATA[数据结构实验之查找二：平衡二叉树]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53503001</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53503001</guid><author>Autii</author><pubDate>Wed, 07 Dec 2016 11:02:00 +0800</pubDate><description><![CDATA[#include
#include 
#include 
#include 
using namespace std;
struct bst {
    int d;
    bst *l,*r;
    int deep;
    bst() {
        l=r=NULL;
        deep=0;
    }
};
int deept(bst *p) {
    if(!p)
 ]]></description><category></category></item><item><title><![CDATA[数据结构实验之排序三：bucket sort]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53447877</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53447877</guid><author>Autii</author><pubDate>Sat, 03 Dec 2016 21:38:53 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
int a[100+5];
int main() {
    int n;
    while(~scanf("%d", &n)) {
        memset(a,0,sizeof(a));
        while(n--) {
            int x;
          ]]></description><category></category></item><item><title><![CDATA[数据结构实验之查找四：二分查找]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53302608</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53302608</guid><author>Autii</author><pubDate>Wed, 23 Nov 2016 11:19:28 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
int a[10000000+5];
int n, m, key;
int fin(int i, int j) {
    if(i>j) return -1;
    int mid=(i+j)/2;
    if(a[mid]==key) return mid-1;
   ]]></description><category></category></item><item><title><![CDATA[数据结构实验之查找一：二叉排序树]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53302132</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53302132</guid><author>Autii</author><pubDate>Wed, 23 Nov 2016 10:48:00 +0800</pubDate><description><![CDATA[#include 
using namespace std;
struct tree {
    int data;
    tree *l, *r;
    tree() {
        l=r=NULL;
    }
};
int x;
bool f;
tree *insert(tree *root) {
    if(!root) {
        root=]]></description><category></category></item><item><title><![CDATA[数据结构实验之图论四：迷宫探索]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53157409</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53157409</guid><author>Autii</author><pubDate>Mon, 14 Nov 2016 11:33:57 +0800</pubDate><description><![CDATA[数据结构实验之图论四：迷宫探索
Time Limit: 1000MS 
Memory Limit: 65536KB 
Submit

Statistic 
Problem Description
有一个地下迷宫，它的通道都是直的，而通道所有交叉点(包括通道的端点)上都有一盏灯和一个开关；请问如何从某个起点开始在迷宫中点亮所有的灯并回到起点？

Input

连续T组数据输入，]]></description><category></category></item><item><title><![CDATA[数据结构实验之图论六：村村通公路]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53102654</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53102654</guid><author>Autii</author><pubDate>Wed, 09 Nov 2016 17:39:11 +0800</pubDate><description><![CDATA[数据结构实验之图论六：村村通公路
Time Limit: 1000MS 
Memory Limit: 65536KB 
Submit

Statistic 
Problem Description
当前农村公路建设正如火如荼的展开，某乡镇政府决定实现村村通公路，工程师现有各个村落之间的原始道路统计数据表，表中列出了各村之间可以建设公路的若干条道路的成本，你的任务是根据给出的数据表，求]]></description><category></category></item><item><title><![CDATA[数据结构实验图论一：基于邻接矩阵的广度优先搜索遍历]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53097894</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53097894</guid><author>Autii</author><pubDate>Wed, 09 Nov 2016 11:32:41 +0800</pubDate><description><![CDATA[数据结构实验图论一：基于邻接矩阵的广度优先搜索遍历
Time Limit: 1000MS Memory Limit: 65536KB
Submit Statistic

Problem Description

给定一个无向连通图，顶点编号从0到n-1，用广度优先搜索(BFS)遍历，输出从某个顶点出发的遍历序列。(同一个结点的同层邻接点，节点编号小的优先遍历）

Input

]]></description><category></category></item><item><title><![CDATA[树结构练习——判断给定森林中有多少棵树]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53097731</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53097731</guid><author>Autii</author><pubDate>Wed, 09 Nov 2016 11:21:31 +0800</pubDate><description><![CDATA[树结构练习——判断给定森林中有多少棵树
Time Limit: 1000MS Memory Limit: 65536KB
Submit Statistic

Problem Description

 众人皆知，在编程领域中，C++是一门非常重要的语言，不仅仅因为其强大的功能，还因为它是很多其他面向对象语言的祖先和典范。不过这世上几乎没什么东西是完美的，C++也不例外，多继承结构在带来]]></description><category></category></item><item><title><![CDATA[数据结构实验：连通分量个数]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53097678</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53097678</guid><author>Autii</author><pubDate>Wed, 09 Nov 2016 11:17:22 +0800</pubDate><description><![CDATA[数据结构实验：连通分量个数
Time Limit: 1000MS Memory Limit: 65536KB
Submit Statistic

Problem Description

 在无向图中，如果从顶点vi到顶点vj有路径，则称vi和vj连通。如果图中任意两个顶点之间都连通，则称该图为连通图，
否则，称该图为非连通图，则其中的极大连通子图称为连通分量，这里所谓的极大是指子图]]></description><category></category></item><item><title><![CDATA[图的深度遍历]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53097331</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53097331</guid><author>Autii</author><pubDate>Wed, 09 Nov 2016 10:59:52 +0800</pubDate><description><![CDATA[图的深度遍历
Time Limit: 1000MS Memory Limit: 65536KB
Submit Statistic

Problem Description

请定一个无向图，顶点编号从0到n-1，用深度优先搜索(DFS)，遍历并输出。遍历时，先遍历节点编号小的。

Input

输入第一行为整数n（0 

Output

输出有n行，对应n组输出，每行为]]></description><category></category></item><item><title><![CDATA[数据结构实验之二叉树六：哈夫曼编码]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53039385</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53039385</guid><author>Autii</author><pubDate>Fri, 04 Nov 2016 21:21:00 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
int main() {
    char s[1000+5];
    int vis[150+5];
    while(~scanf("%s", s)) {
        memset(vis,0,sizeof(vis));
        int ]]></description><category></category></item><item><title><![CDATA[POJ 2513 Colored Sticks]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/53000313</link><guid>https://blog.youkuaiyun.com/Autii/article/details/53000313</guid><author>Autii</author><pubDate>Tue, 01 Nov 2016 20:39:29 +0800</pubDate><description><![CDATA[Language:
Default

Colored Sticks




Time Limit: 5000MS
 
Memory Limit: 128000K


Total Submissions: 36032
 
Accepted: 9427




Description

You are given a bunch of wooden stic]]></description><category></category></item><item><title><![CDATA[数据结构实验之串三：KMP应用]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/52932151</link><guid>https://blog.youkuaiyun.com/Autii/article/details/52932151</guid><author>Autii</author><pubDate>Wed, 26 Oct 2016 10:43:32 +0800</pubDate><description><![CDATA[数据结构实验之串三：KMP应用
Time Limit: 1000MS 
Memory Limit: 65536KB 
Submit

Statistic 
Problem Description

有n个小朋友，每个小朋友手里有一些糖块，现在这些小朋友排成一排，编号是由1到n。现在给出m个数，能不能唯一的确定一对值l和r(l 

Input

首先输入一个整数n，代表有n个]]></description><category></category></item><item><title><![CDATA[数据结构实验之二叉树四：还原二叉树]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/52871975</link><guid>https://blog.youkuaiyun.com/Autii/article/details/52871975</guid><author>Autii</author><pubDate>Thu, 20 Oct 2016 13:59:24 +0800</pubDate><description><![CDATA[数据结构实验之二叉树四：还原二叉树
Time Limit: 1000MS 
Memory Limit: 65536KB 
Submit

Statistic 
Problem Description

给定一棵二叉树的先序遍历序列和中序遍历序列，要求计算该二叉树的高度。

Input
输入数据有多组，每组数据第一行输入1个正整数N(1 为树中结点总数，随后2行先后给出先序和中]]></description><category></category></item><item><title><![CDATA[数据结构实验之二叉树三：统计叶子数]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/52808762</link><guid>https://blog.youkuaiyun.com/Autii/article/details/52808762</guid><author>Autii</author><pubDate>Thu, 13 Oct 2016 17:48:32 +0800</pubDate><description><![CDATA[数据结构实验之二叉树三：统计叶子数
Time Limit: 1000MS Memory Limit: 65536KB 
Submit

Statistic 
Problem Description

已知二叉树的一个按先序遍历输入的字符序列，如abc,,de,g,,f,,, (其中,表示空结点)。请建立二叉树并求二叉树的叶子结点个数。

Input

连续输入多组数据，每组数]]></description><category></category></item><item><title><![CDATA[数据结构实验之二叉树二：遍历二叉树]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/52808748</link><guid>https://blog.youkuaiyun.com/Autii/article/details/52808748</guid><author>Autii</author><pubDate>Thu, 13 Oct 2016 17:46:24 +0800</pubDate><description><![CDATA[数据结构实验之二叉树二：遍历二叉树
Time Limit: 1000MS Memory Limit: 65536KB 
Submit

Statistic 
Problem Description

已知二叉树的一个按先序遍历输入的字符序列，如abc,,de,g,,f,,, (其中,表示空结点)。请建立二叉树并按中序和后序的方式遍历该二叉树。

Input

连续输入多组数据]]></description><category></category></item><item><title><![CDATA[数据结构实验之串二：字符串匹配]]></title><link>https://blog.youkuaiyun.com/Autii/article/details/52808697</link><guid>https://blog.youkuaiyun.com/Autii/article/details/52808697</guid><author>Autii</author><pubDate>Thu, 13 Oct 2016 17:40:33 +0800</pubDate><description><![CDATA[数据结构实验之串二：字符串匹配
Time Limit: 1000MS 
Memory Limit: 65536KB 
Submit

Statistic 
Problem Description

  给定两个字符串string1和string2，判断string2是否为string1的子串。
 


Input
 输入包含多组数据，每组测试数据包含两行，第一行代表str]]></description><category></category></item></channel></rss>