<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[AVICIIl的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/AVICIIl</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; AVICIIl]]></copyright><item><title><![CDATA[中缀、前缀、后缀表达式的转换和计算]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/127453353</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/127453353</guid><author>AVICIIl</author><pubDate>Fri, 21 Oct 2022 20:25:14 +0800</pubDate><description><![CDATA[408 栈的应用]]></description><category></category></item><item><title><![CDATA[KMP算法]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/125952567</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/125952567</guid><author>AVICIIl</author><pubDate>Sat, 23 Jul 2022 20:58:34 +0800</pubDate><description><![CDATA[KMP算法]]></description><category></category></item><item><title><![CDATA[软件体系结构目录]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/122114388</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/122114388</guid><author>AVICIIl</author><pubDate>Thu, 23 Dec 2021 19:01:39 +0800</pubDate><description><![CDATA[FZU软件体系结构重点目录]]></description><category></category></item><item><title><![CDATA[从软件本质的角度看待软件危机]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/122114357</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/122114357</guid><author>AVICIIl</author><pubDate>Thu, 23 Dec 2021 19:00:20 +0800</pubDate><description><![CDATA[FZU软件体系结构期末考题文章]]></description><category></category></item><item><title><![CDATA[FZU操作系统期末重点笔记]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/122114313</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/122114313</guid><author>AVICIIl</author><pubDate>Thu, 23 Dec 2021 18:56:37 +0800</pubDate><description><![CDATA[设备独立性含义

用户或程序中使用的设备与具体物理设备无关，用户或程序使用的是逻辑设备，当进程运行时，由操作系统与物理设备直接进行连接，即设备的分配。把这种设备使用方法的特点称为设备独立性。

系统调用与用户子程序的主要区别

系统调用运行在核心态，用户子程序运行在用户态
系统调用的执行产生中断即访管中断，而用户子程序的运行不会产生中断
系统调用子程序代码与调用者的程序代码是独立、分开的，而用户子程序代码与调用者的程序代码共享同一个进程地址空间
不同用户可以共享使用同一个系统调用，用户子程序通常不能由其他用]]></description><category></category></item><item><title><![CDATA[FZU数据库系统原理复习笔记]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/122114146</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/122114146</guid><author>AVICIIl</author><pubDate>Thu, 23 Dec 2021 18:46:44 +0800</pubDate><description><![CDATA[福州大学数据库系统原理期末考试重点整理2021年程烨班]]></description><category></category></item><item><title><![CDATA[x76. Minimum Window Substring(Hard)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120690528</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120690528</guid><author>AVICIIl</author><pubDate>Sun, 10 Oct 2021 19:17:53 +0800</pubDate><description><![CDATA[滑动窗口、双指针]]></description><category></category></item><item><title><![CDATA[×142. Linked List Cycle II(Medium)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120687896</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120687896</guid><author>AVICIIl</author><pubDate>Sun, 10 Oct 2021 16:17:30 +0800</pubDate><description><![CDATA[快慢指针、双指针、哈希表]]></description><category></category></item><item><title><![CDATA[88. Merge Sorted Array(Easy)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120687019</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120687019</guid><author>AVICIIl</author><pubDate>Sun, 10 Oct 2021 15:28:29 +0800</pubDate><description><![CDATA[双指针]]></description><category></category></item><item><title><![CDATA[167. Two Sum II - Input array is sorted(Easy)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120668379</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120668379</guid><author>AVICIIl</author><pubDate>Sat, 09 Oct 2021 12:02:34 +0800</pubDate><description><![CDATA[双指针、二分查找]]></description><category></category></item><item><title><![CDATA[×665. Non-decreasing Array(Medium)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120662901</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120662901</guid><author>AVICIIl</author><pubDate>Sat, 09 Oct 2021 00:48:32 +0800</pubDate><description><![CDATA[需补题]]></description><category></category></item><item><title><![CDATA[406. Queue Reconstruction by Height(Medium)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120660869</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120660869</guid><author>AVICIIl</author><pubDate>Fri, 08 Oct 2021 21:58:08 +0800</pubDate><description><![CDATA[贪心算法，排序，插入]]></description><category></category></item><item><title><![CDATA[122. Best Time to Buy and Sell Stock II(Medium)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120659007</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120659007</guid><author>AVICIIl</author><pubDate>Fri, 08 Oct 2021 20:15:23 +0800</pubDate><description><![CDATA[贪心算法]]></description><category></category></item><item><title><![CDATA[763. Partition Labels(Medium)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120658145</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120658145</guid><author>AVICIIl</author><pubDate>Fri, 08 Oct 2021 19:26:11 +0800</pubDate><description><![CDATA[贪心，区间重叠，二维向量的定义]]></description><category></category></item><item><title><![CDATA[题目中的英语短语积累]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120641608</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120641608</guid><author>AVICIIl</author><pubDate>Thu, 07 Oct 2021 21:03:01 +0800</pubDate><description><![CDATA[assign
英[əˈsaɪn]
美[əˈsaɪn]













vt.
分配(某物); 指定; 指派; 分派，布置(工作、任务等); 委派; 派遣;












[其他]
第三人称单数：assigns 现在分词：assigning 过去式：assigned 过去分词：assigned














subject to





英[ˈsʌbdʒɪkt tu]
美[ˈsʌbdʒɪkt tu]






v.
从属于; 处于…中; 使服从;







...]]></description><category></category></item><item><title><![CDATA[452. Minimum Number of Arrows to Burst Balloons(Medium)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120641550</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120641550</guid><author>AVICIIl</author><pubDate>Thu, 07 Oct 2021 20:59:18 +0800</pubDate><description><![CDATA[题目描述](https://leetcode-cn.com/problems/minimum-number-of-arrows-to-burst-balloons/)

解题思路：这题与435. Non-overlapping Intervals类似，但是本题是求最小的共同重叠数。
所以方法类似，只是得一直与第一个重叠的区间比较，没有和他重叠才更新prev。


解题过程中出现的问题：

想着跳出循环后再判断最后一个区间的情况，最后发现不需要。


class Solution {
public:
    ]]></description><category></category></item><item><title><![CDATA[605. Can Place Flowers(Easy)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120640609</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120640609</guid><author>AVICIIl</author><pubDate>Thu, 07 Oct 2021 20:05:24 +0800</pubDate><description><![CDATA[题目描述
解题思路：计算两个1之间的下标差，利用数学规律解题。

在两个1中间时，可以中的花数目=(blank-1)/2
在两边时=blank/2。
向下取整

解题过程中遇见的问题：


本来是想记录两个1之间blank的数量来进行计算，后面考虑到特殊情况时（两边没有1的时候）发现可以用下标差来计算。


特殊情况：左边没有1，可以令初始下标=-2来解决
​					右边没有1，跳出循环后再进行一次计算可以栽的花=(i-prev-1)/2向下取整。
注意跳出循环时的i已经加1完的时候了，等价于blank/]]></description><category></category></item><item><title><![CDATA[435.Non-overlapping Intervals(Medium)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120638938</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120638938</guid><author>AVICIIl</author><pubDate>Thu, 07 Oct 2021 17:36:36 +0800</pubDate><description><![CDATA[题目描述
解题思路：本来觉得应该按长度来排序，然后如果有重叠则删去后面长的区间比较节省。那么我就得解决以下问题：

排序问题
用什么来标记已经出现的序列。（两个数组一正一负，出现的地方标1）
判断重叠，重复现象。

但是没有体现贪心算法。

正解：先按首/尾排序再按长度排序，这样既不用记录已出现的区域，又能轻松判断第三点（后面区域的首在前面的区间里就算重叠）。

class Solution {
public:
   
    int eraseOverlapIntervals(vector&lt;vect]]></description><category></category></item><item><title><![CDATA[135.Candy(Hard)]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/120637868</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/120637868</guid><author>AVICIIl</author><pubDate>Thu, 07 Oct 2021 16:33:15 +0800</pubDate><description><![CDATA[135. Candy
类型：贪心算法中的分配问题。想到了用从左到右再从右到左两次遍历来更新糖果数，但过程中犯了两个错误：

最初想当然的把比左/右边rating大的就直接加1，没考虑糖果数量也得比左/右的大。
遍历时比较更新糖果数的对象错了，应该是更新后面要继续和别人比的那个人的糖果数，而不是比完了的那个人的糖果数，不然没有起到串联作用。

class Solution {
public:
    int candy(vector&lt;int&gt;&amp; ratings) {
        int]]></description><category></category></item><item><title><![CDATA[P1631 序列合并（优先队列）]]></title><link>https://blog.youkuaiyun.com/AVICIIl/article/details/105455882</link><guid>https://blog.youkuaiyun.com/AVICIIl/article/details/105455882</guid><author>AVICIIl</author><pubDate>Sat, 11 Apr 2020 17:18:54 +0800</pubDate><description><![CDATA[有两个长度都是N的序列A和B，在A和B中各取一个数相加可以得到N^2N 
2
 个和，求这N^2N 
2
 个和中最小的N个。]]></description><category></category></item></channel></rss>