<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LoveStackover的博客]]></title><description><![CDATA[编程小子]]></description><link>https://blog.youkuaiyun.com/LoveStackover</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LoveStackover]]></copyright><item><title><![CDATA[高级IO之简单的select_poll_epoll实验（五）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79323188</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79323188</guid><author>LoveStackover</author><pubDate>Tue, 19 Jan 2021 15:45:44 +0800</pubDate><description><![CDATA[1. 题目


  笔者出题：分别使用select, poll, epoll实现回显程序




2. 代码展示



2.1：select



#include &amp;amp;lt;fcntl.h&amp;amp;gt;
#include &amp;amp;lt;stdio.h&amp;amp;gt;
#include &amp;amp;lt;stdlib.h&amp;amp;gt;
#include &amp;amp;lt;err.h&amp;amp;gt;]]></description><category></category></item><item><title><![CDATA[高级IO之Select_pselect_poll_epoll（四）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79322932</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79322932</guid><author>LoveStackover</author><pubDate>Tue, 19 Jan 2021 15:45:32 +0800</pubDate><description><![CDATA[1. 基础概念

　　同时操作多个fd时，如果使用阻塞的方式，可能导致程序效率低下。我们可以使用非阻塞方式的IO，通过不断查询数据操作的结果来进行接下来的操作，这种处理方式就是轮询，缺点就是非常消耗CPU资源。所以在某种意义上其相当于阻塞的调用了IO函数read或者write，可以通过异步IO的方式来解决这个问题，但是因为一个进程只使用一个或者几个信号，当捕获该信号时无法判断是哪个fd数据就绪。最...]]></description><category></category></item><item><title><![CDATA[网络编程之Sockets Introduction(二)]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79432926</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79432926</guid><author>LoveStackover</author><pubDate>Tue, 19 Jan 2021 15:44:46 +0800</pubDate><description><![CDATA[1. inet_aton, inet_addr, and inet_ntoa Functions



#include &amp;amp;lt;arpa/inet.h&amp;amp;gt;
int inet_aton(const char *strptr, struct in_addr *addrptr);
Returns: 1 if string was valid, 0 on error
in_addr_t inet_a...]]></description><category></category></item><item><title><![CDATA[网络编程之Sockets Introduction(一)]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79428394</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79428394</guid><author>LoveStackover</author><pubDate>Tue, 19 Jan 2021 15:44:25 +0800</pubDate><description><![CDATA[前言

　　一直在想该怎么记录UNP篇，最后我想我要锻炼自己归纳总结的能力，抓重点，抓应用。



1. introdution

　　本章主要分析了地址结构体的相关API函数，及2进制和字符串形式的地址之间的转化函数，最后这些地址转换函数依赖于具体的IP协议，UNP中提出了自己的以sock_开头的地址转换函数，其不依赖于具体的协议。


  
  These structures can be ...]]></description><category></category></item><item><title><![CDATA[网络编程之Elementary TCP Sockets(二)]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79451084</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79451084</guid><author>LoveStackover</author><pubDate>Tue, 19 Jan 2021 15:44:00 +0800</pubDate><description><![CDATA[1. fork and exec Functions

　　笔者在APUE中比较详细的记录过fork函数，这里相关细节不在赘述，只看看和网络编程相关的概念：


  
  The parent calls accept and then calls fork. The connected socket is then shared between the parent and child. Nor...]]></description><category></category></item><item><title><![CDATA[网络编程之Elementary TCP Sockets(一)]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79450398</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79450398</guid><author>LoveStackover</author><pubDate>Tue, 19 Jan 2021 15:43:43 +0800</pubDate><description><![CDATA[1. socket



#include &amp;amp;lt;sys/socket.h&amp;amp;gt;
int socket(int family, int type, int protocol);
Returns: non-negative descriptor if OK, −1 on error



　　上表就是对该函数的一个总结，在APUE篇笔者也记录过该内容，在此不赘述，上表没有反映出来的几点需要注意下...]]></description><category></category></item><item><title><![CDATA[《DP学习系列》从零开始学习动态规划，有依赖的背包问题（七）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/80652494</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/80652494</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:47:44 +0800</pubDate><description><![CDATA[1. 预备部分

　　如果真的从零开始学习DP，那么从七讲以后的部分就要烧脑细胞了。如果是为了笔试准备，笔者感觉后面就可以不用看了。但是笔者这里还是完整记录完，我们看别人的结论尚且要思索万千，所以崔添翼真是非常聪明。该部分来自NOIP2006的比赛原题，所以我们初学者也有必要看看前因后果，原题如该博主记录所示。



2. 简化的问题

　　金明的预算的原题节选：


  把想买的物品分为两类：主...]]></description><category></category></item><item><title><![CDATA[《DP学习系列》从零开始学习动态规划，混合背包（四）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/80595713</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/80595713</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:47:27 +0800</pubDate><description><![CDATA[前言

　　引文出自崔添翼背包９讲。



1. 题目对比


  
  问题1：有 N 件物品和一个容量为 V 的背包。放入第 i 件物品耗费的费用是 Ci，得到的价值是 Wi。求解将哪些物品装入背包可使价值总和最大。
  问题2：有N种物品和一个容量为V的背包，每种物品都有无限件可用。放入第i种物品的费用是Ci，价值是Wi。求解：将哪些物品装入背包，可使这些物品的耗费的费用总和不超过背包容量，...]]></description><category></category></item><item><title><![CDATA[DSAA之图论Kruskal算法（七）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/80645914</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/80645914</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:47:15 +0800</pubDate><description><![CDATA[1. 回顾

　　Kruskal算法需要使用并查集，所以记录该篇前需要回顾DSAA之THE DISJOINT SET ADT（一）和DSAA之THE DISJOINT SET ADT（二）。不相交集合的概念和实现都是比较简单。



2. Kruskal’s Algorithm 　　


  
  A second greedy strategy is continually to select ...]]></description><category></category></item><item><title><![CDATA[算法补充之KMP作用原理（一）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/80791909</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/80791909</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:47:04 +0800</pubDate><description><![CDATA[1. 整体把握

　　一般都可以想到O(n2)O(n2)O(n^2)的暴力算法，KMP改进暴力算法使其算法复杂度为O(m+n)。本文参考：维基百科。

2.算法学习



2.1 使用局部匹配表


  
  To illustrate the algorithm’s details, consider a (relatively artificial) run of the algorithm,...]]></description><category></category></item><item><title><![CDATA[DSAA之图论Dijkstra（贪婪算法）（五）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/80577508</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/80577508</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:46:41 +0800</pubDate><description><![CDATA[1. 前言

　　有网友把Dijkstra归为BFS算法，笔者觉得是不准确的，两者的差别在于每个阶段是否是最优选择，也就是是否达到局部最优，当然不保证全局最优。

2. 定义


  
  We keep all of the same information as before. Thus, each vertex is marked as either known or unknown. A ...]]></description><category></category></item><item><title><![CDATA[The Python Tutorial之Class(一)]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79601246</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79601246</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:46:01 +0800</pubDate><description><![CDATA[1.  A Word About Names and Objects


  
  Objects have individuality, and multiple names (in multiple scopes) can be bound to the same object. This is known as aliasing in other languages. 
  For exam...]]></description><category></category></item><item><title><![CDATA[The Python Tutorial之Class(二)]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79619572</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79619572</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:45:52 +0800</pubDate><description><![CDATA[1. Class Objects


  When a class definition is entered, a new namespace is created, and used as the local scope — thus, all assignments to local variables go into this new namespace. In particular, f...]]></description><category></category></item><item><title><![CDATA[The Search Tree的Python实现(二)]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79619801</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79619801</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:45:42 +0800</pubDate><description><![CDATA[1. The Search Tree ADT-Binary Search Trees


  
  The property that makes a binary tree into a binary search tree is that for every node, X, in the tree, the values of all the keys in the left subtree...]]></description><category></category></item><item><title><![CDATA[The Python Tutorial之Class(三)]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79637980</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79637980</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:45:30 +0800</pubDate><description><![CDATA[1. Inheritance


  
  The name BaseClassName must be defined in a scope containing the derived class definition. In place of a base class name, other arbitrary expressions are also allowed. This can b...]]></description><category></category></item><item><title><![CDATA[《DP学习系列》Longest Valid Parentheses的一些DP细节思考]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/80848422</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/80848422</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:44:18 +0800</pubDate><description><![CDATA[1. Longest Valid Parentheses


  
  Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.
  Example 1: 
  Input: “(()” 
 ...]]></description><category></category></item><item><title><![CDATA[《DP学习系列》从零开始学习动态规划，完全背包（二）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/80550843</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/80550843</guid><author>LoveStackover</author><pubDate>Fri, 20 Nov 2020 11:43:53 +0800</pubDate><description><![CDATA[前言

　　如果您也是参考笔者的记录学习，那么推荐您至少先看一遍原版背包九讲。本系列只是初学者对若干问题的补充和思考。



1. 题目


  有N种物品和一个容量为V的背包，每种物品都有无限件可用。放入第i种物品的费用是CiCiC_{i}，价值是WiWiW_{i}。求解：将哪些物品装入背包，可使这些物品的耗费的费用总和不超过背包容量，且价值总和最大。 


2. 基本思路


  如果仍然按照...]]></description><category></category></item><item><title><![CDATA[进程IPC之PIPE（一）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79333253</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79333253</guid><author>LoveStackover</author><pubDate>Thu, 19 Nov 2020 11:53:30 +0800</pubDate><description><![CDATA[1. PIPE



#include &amp;amp;lt;unistd.h&amp;amp;gt;
int pipe(int fd[2]);
Returns: 0 if OK, −1 on error

　　Pipe半双工且只能用于具有共同父进程的进程间通信, 当其返回的时候设置fd[0]为读端口，fd[1]为写端口，且fd[1]与fd[0]相连。如下图所示： 


　　其中Pipe的使用关键只要记住下面这个图： 


　...]]></description><category></category></item><item><title><![CDATA[第三章 万物皆对象]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/108343248</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/108343248</guid><author>LoveStackover</author><pubDate>Tue, 01 Sep 2020 15:29:25 +0800</pubDate><description><![CDATA[前言
今天打卡第三章，目标记录下关键点，记录下疑问点，按照书的排版笔记。以前记笔记都是流水账非常详细，花费了大量时间。现在改变记笔记的方式。也不求非要是英文原版教材，中文教材翻译尚可，就直接看中文。

...]]></description><category></category></item><item><title><![CDATA[通过我写的文章来认识我，博客文章快速导航（慢慢整理）]]></title><link>https://blog.youkuaiyun.com/LoveStackover/article/details/79536248</link><guid>https://blog.youkuaiyun.com/LoveStackover/article/details/79536248</guid><author>LoveStackover</author><pubDate>Wed, 05 Aug 2020 10:52:30 +0800</pubDate><description><![CDATA[1. 前言

　　本博客持续更新，本篇是博主所写文章的快速索引。 
　　不得不说，笔者学习的东西很多，很杂，有些东西的学习，并不是笔者自愿的，也和笔者的经历有关吧。 
　　特别强调笔者以前的博客为bushipeien，某天脑门一热想和过去的排版及方向告别，重新开始在该博客更新。为了节约时间，可能不会将以前的文章重新排版整理到本博客。最后本文也单独列出博主认为比较好的，能够反映博主学习思考过程的文章...]]></description><category></category></item></channel></rss>