<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Formy7的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Formy7</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Formy7]]></copyright><item><title><![CDATA[排序算法及Java实现总结]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/128383935</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/128383935</guid><author>Formy7</author><pubDate>Tue, 20 Dec 2022 14:05:42 +0800</pubDate><description><![CDATA[排序算法及Java实现总结。]]></description><category></category></item><item><title><![CDATA[跳台阶问题(类似斐波那契数列)]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/128063389</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/128063389</guid><author>Formy7</author><pubDate>Sun, 27 Nov 2022 13:40:12 +0800</pubDate><description><![CDATA[跳台阶问题(类似斐波那契数列)的两种做法]]></description><category></category></item><item><title><![CDATA[KMP字符串匹配算法]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/128028021</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/128028021</guid><author>Formy7</author><pubDate>Thu, 24 Nov 2022 22:15:05 +0800</pubDate><description><![CDATA[same可能就是其他文章中提到的next数组。]]></description><category></category></item><item><title><![CDATA[二分查找(搜索区间为左闭右开)]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/126176938</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/126176938</guid><author>Formy7</author><pubDate>Fri, 05 Aug 2022 14:27:04 +0800</pubDate><description><![CDATA[二分查找搜索区间为左闭右开时的思路。]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 计算机网络安全_7_虚拟专网技术]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/125015604</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/125015604</guid><author>Formy7</author><pubDate>Sat, 28 May 2022 10:50:42 +0800</pubDate><description><![CDATA[VPN技术]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 计算机网络安全_6_入侵检测系统]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/125015567</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/125015567</guid><author>Formy7</author><pubDate>Sat, 28 May 2022 10:45:32 +0800</pubDate><description><![CDATA[入侵系统检测]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 计算机网络安全_5_防火墙原理与设计]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/125015501</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/125015501</guid><author>Formy7</author><pubDate>Sat, 28 May 2022 10:43:05 +0800</pubDate><description><![CDATA[防火墙原理与设计]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 计算机网络安全_4_网络扫描和网络监听]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/125015351</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/125015351</guid><author>Formy7</author><pubDate>Sat, 28 May 2022 10:37:49 +0800</pubDate><description><![CDATA[网络扫描与监听]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 计算机网络安全_3_Web安全]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/125015272</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/125015272</guid><author>Formy7</author><pubDate>Sat, 28 May 2022 10:25:01 +0800</pubDate><description><![CDATA[[笔记] 计算机网络安全：（3）Web安全

网络安全基础
internet协议的安全性
Web安全
网络扫描和网络监听
防火墙原理与设计
入侵检测系统
VPN技术


目录[笔记] 计算机网络安全：（3）Web安全@[TOC](目录)3.1 Web安全概述3.1.1 Web服务器的安全Web应用的信息收集攻击Web服务器软件攻击Web应用程序攻击Web数据内容3.1.2 Web客户端的安全3.1.3 Web通信信道的安全3.2 Web服务器指纹识别3.2.1 Web服务器指纹介绍3.2.2 Web服务器B]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 计算机网络安全_2_internet协议的安全性]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/124841040</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/124841040</guid><author>Formy7</author><pubDate>Sat, 28 May 2022 10:20:51 +0800</pubDate><description><![CDATA[[笔记] 计算机网络安全：（2）internet协议的安全性
2.1 网络层协议
2.1.1 IP协议的安全性
IP数据报格式

潜在的安全问题

IP协议未验证IP地址
IP协议支持定向广播
IP协议未对数据加密
IP协议仅对首部进行校验
IP源路由选项支持
IP协议支持分段重组

IP安全问题1：针对IP地址的攻击
IP协议未验证IP地址的真实性

IP地址欺骗攻击

源IP地址欺骗：IP协议缺乏对地址真实性的认证机制，不能保证数据就是从数据包中给定的源地址发出的。
目的IP地址欺骗：IP协议也不能保证]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 计算机网络安全_1_网络安全基础]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/124840124</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/124840124</guid><author>Formy7</author><pubDate>Sat, 28 May 2022 10:10:16 +0800</pubDate><description><![CDATA[计算机网络安全：（1）网络安全基础
]]></description><category></category></item><item><title><![CDATA[[ 信息系统安全实验1 ] 软件安全：格式化字符串漏洞实验]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/125005378</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/125005378</guid><author>Formy7</author><pubDate>Fri, 27 May 2022 15:59:26 +0800</pubDate><description><![CDATA[华科信息系统安全实验1 格式化字符串漏洞实验]]></description><category></category></item><item><title><![CDATA[[ 环境搭建 ] Ubuntu安装后环境配置]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/122693615</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/122693615</guid><author>Formy7</author><pubDate>Tue, 25 Jan 2022 23:06:52 +0800</pubDate><description><![CDATA[Ubuntu 20.04LTS安装后环境配置
换源
直接编辑，所在文件夹中已经有备份文件sources.bak
sudo gedit /etc/apt/sources.list

我常用阿里源，觉得企业维护可能好一点
deb http://mirrors.aliyun.com/ubuntu/ focal main restricted universe multiverse

deb-src http://mirrors.aliyun.com/ubuntu/ focal main restricted un]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 操作系统复习笔记]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/122417756</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/122417756</guid><author>Formy7</author><pubDate>Mon, 10 Jan 2022 19:43:48 +0800</pubDate><description><![CDATA[操作系统复习笔记]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 计网复习]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/122223024</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/122223024</guid><author>Formy7</author><pubDate>Wed, 29 Dec 2021 19:27:01 +0800</pubDate><description><![CDATA[计算机网络复习笔记]]></description><category></category></item><item><title><![CDATA[[ 笔记 ] 编译原理复习]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/122124744</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/122124744</guid><author>Formy7</author><pubDate>Fri, 24 Dec 2021 11:48:51 +0800</pubDate><description><![CDATA[HUST编译原理复习笔记]]></description><category></category></item><item><title><![CDATA[[ 回溯 ] 复原IP地址]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/119084642</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/119084642</guid><author>Formy7</author><pubDate>Sun, 25 Jul 2021 17:23:10 +0800</pubDate><description><![CDATA[93. 复原 IP 地址 - 力扣（LeetCode） (leetcode-cn.com)
复原IP地址

DFS
回溯
ip有效性的判断
什么时候进入下一层

class Solution {
public:
    vector&lt;string&gt; ans;
    string path;

    void DFS(string&amp; s, int index, int pointNum) {
        // 结束条件与返回值有关，返回值有三个点时返回
        if (po]]></description><category></category></item><item><title><![CDATA[[ 回溯 ] 分割回文串]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/119084629</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/119084629</guid><author>Formy7</author><pubDate>Sun, 25 Jul 2021 17:22:37 +0800</pubDate><description><![CDATA[131. 分割回文串 - 力扣（LeetCode） (leetcode-cn.com)
分割回文串

与数组组合不同的是，数组是取数，该题是找分割线

class Solution {
public:
    // 返回值
    vector&lt;vector&lt;string&gt;&gt; ans;
    vector&lt;string&gt; path;
    
    // DFS
    void DFS(string&amp; s, int index) {
        // 边]]></description><category></category></item><item><title><![CDATA[[ 回溯 ] 电话号码的字母组合]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/119084609</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/119084609</guid><author>Formy7</author><pubDate>Sun, 25 Jul 2021 17:21:52 +0800</pubDate><description><![CDATA[17. 电话号码的字母组合 - 力扣（LeetCode） (leetcode-cn.com)
电话号码的字母组合

DFS
回溯

class Solution {
public:
    // 将9键映射到数字
    const string mp[10] = {"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz",};
    
    vector&lt;string&gt; ans;
    string path;

    void D]]></description><category></category></item><item><title><![CDATA[[ 回溯 ] 组合总和III]]></title><link>https://blog.youkuaiyun.com/Formy7/article/details/119084591</link><guid>https://blog.youkuaiyun.com/Formy7/article/details/119084591</guid><author>Formy7</author><pubDate>Sun, 25 Jul 2021 17:21:11 +0800</pubDate><description><![CDATA[216. 组合总和 III - 力扣（LeetCode） (leetcode-cn.com)
组合总和 III

DFS
回溯
剪枝， 剪枝是根据条件剪枝，比如在for循环根据for剪枝， 在边界处根据n剪枝

class Solution {
public:
    vector&lt;vector&lt;int&gt;&gt; ans;
    vector&lt;int&gt; path;

    void DFS(int k, int n, int sum, int index) {
      ]]></description><category></category></item></channel></rss>