<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[bryce_zsq的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bryce_zsq</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bryce_zsq]]></copyright><item><title><![CDATA[【数据结构】查找]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/140934060</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/140934060</guid><author>bryce_zsq</author><pubDate>Mon, 05 Aug 2024 18:36:30 +0800</pubDate><description><![CDATA[查找，顾名思义，就是在给定的序列中查询所需要的关键字。给定的序列可以是线性结构，也可以是树形结构。不同的查找策略也与不同的场景，数据结构对应着。]]></description><category></category></item><item><title><![CDATA[【数据结构】排序]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/140919065</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/140919065</guid><author>bryce_zsq</author><pubDate>Mon, 05 Aug 2024 11:43:47 +0800</pubDate><description><![CDATA[总体来说，排序分为内部排序和外部排序。其中，内部排序又分为插入排序、交换排序、选择排序、归并排序、基数排序、计数排序几大类。]]></description><category></category></item><item><title><![CDATA[网络中两台主机通信的完整过程]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/136235007</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/136235007</guid><author>bryce_zsq</author><pubDate>Thu, 22 Feb 2024 15:18:29 +0800</pubDate><description><![CDATA[主机A查看自己的ARP缓存，检查是否有主机B的IP到MAC的映射，如果有映射，构造报文，目的IP为主机B的IP，源IP为主机A的IP，目的MAC为主机B的MAC，源MAC为主机A的MAC，将报文发送给交换机C，交换机C进行MAC地址表学习，将主机A的MAC和报文入端口号记录下来，然后交换机C查看自己的MAC转发表，检查是否有主机B的MAC到端口的映射，如果有映射，获取对应的端口，将报文从此端口转发出去，报文到达主机B。主机B向主机A回复报文的过程类似。主机A和主机B通信报文的转发过程。]]></description><category></category></item><item><title><![CDATA[模拟实现路由器]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/136178415</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/136178415</guid><author>bryce_zsq</author><pubDate>Mon, 19 Feb 2024 21:18:49 +0800</pubDate><description><![CDATA[模拟路由器
概述
在本项目中将编写一个简单模拟路由器。该路由器将接收原始以太网帧，并像真正的路由器一样处理它们：将它们转发到正确的传出接口，创建新帧等。 本项目中，可以将路由器、主机节点、交换机节点以线程或进程的方式实现，节点之间的通信看成是线程/进程间通信，使用进程间通信机制或消息队列等其它方式实现。
路由器任务描述

处理以太网帧
处理ARP分组
处理IPV4分组
处理ICMP分组

主机节点任务描述

构造IPV4分组
构造以太网帧

交换机任务描述

交换表数据结构
实现以太网交换机自学习算法
基于]]></description><category></category></item><item><title><![CDATA[Nandteris project1]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/136098863</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/136098863</guid><author>bryce_zsq</author><pubDate>Mon, 12 Feb 2024 00:20:42 +0800</pubDate><description><![CDATA[【代码】Nandteris project1。]]></description><category></category></item><item><title><![CDATA[RSS-Reader]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/131864016</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/131864016</guid><author>bryce_zsq</author><pubDate>Sat, 22 Jul 2023 10:06:56 +0800</pubDate><description><![CDATA[Vue+Flask+SQLite的RSS阅读器]]></description><category></category></item><item><title><![CDATA[链表day0——移除结点]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/127618569</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/127618569</guid><author>bryce_zsq</author><pubDate>Mon, 31 Oct 2022 16:37:54 +0800</pubDate><description><![CDATA[移除节点的简单操作]]></description><category></category></item><item><title><![CDATA[链表day2—交换结点]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/127617937</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/127617937</guid><author>bryce_zsq</author><pubDate>Mon, 31 Oct 2022 16:17:40 +0800</pubDate><description><![CDATA[交换结点的简单操作]]></description><category></category></item><item><title><![CDATA[反转链表 双指针以及递归的写法]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/127606077</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/127606077</guid><author>bryce_zsq</author><pubDate>Sun, 30 Oct 2022 22:05:12 +0800</pubDate><description><![CDATA[简单的链表反转]]></description><category></category></item><item><title><![CDATA[BJFU-Algorithm Design and Analysis-Experiment 7_string]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/117150628</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/117150628</guid><author>bryce_zsq</author><pubDate>Sat, 22 May 2021 16:49:47 +0800</pubDate><description><![CDATA[字符串操作

描述
给定一个字符串S，打印操作结果。操作如下：
Insert x i：将字符x插入位置i；
Erase x：删除字符串S中的所有字符x；
Replace x y：将字符串S中的所有字符x替换为y；
Size：打印字符串的大小；
Reverse：打印字符串S的反转；在此操作中不要更改S；
Sub i j：打印从位置i到j的S的子串；
Find str：打印字符串S中第一个str的起始位置；如果str不是S的子字符串，则打印-1。
输入
每个测试用例的第一行包含一个字符串S。接下来是5行。第一行]]></description><category></category></item><item><title><![CDATA[bjfu_java_实验5]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/117033127</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/117033127</guid><author>bryce_zsq</author><pubDate>Wed, 19 May 2021 16:04:29 +0800</pubDate><description><![CDATA[java实验5




代码：
frame类
import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
import java.io.*;
import java.util.LinkedList;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;

public class frame {
    JFrame frame1 = new J]]></description><category></category></item><item><title><![CDATA[bjfu_Algorithm Design and Analysis-Experiment 6]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/117017247</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/117017247</guid><author>bryce_zsq</author><pubDate>Wed, 19 May 2021 10:19:34 +0800</pubDate><description><![CDATA[7 Advanced Data Structure

Binary Tree
描述
Given the preorder sequence and inorder sequence of a binary tree, can you find out its postorder sequence?
输入
The first line is an integer N (1&lt;=N&lt;=1000), the number of vertices of the binary tree. The next ]]></description><category></category></item><item><title><![CDATA[linux读者写者问题]]></title><link>https://blog.youkuaiyun.com/bryce_zsq/article/details/116465041</link><guid>https://blog.youkuaiyun.com/bryce_zsq/article/details/116465041</guid><author>bryce_zsq</author><pubDate>Thu, 06 May 2021 22:39:52 +0800</pubDate><description><![CDATA[#include 
#include &lt;stdio.h&gt;
#include &lt;stdlib.h&gt;
#include &lt;unistd.h&gt;
#include &lt;pthread.h&gt;
#include &lt;semaphore.h&gt;
using namespace std;
pthread_t Reader_id[100];
pthread_t Writer_id[100];
int Writer_num,Reader_num;//读者，写者个数
int ]]></description><category></category></item></channel></rss>