<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[aliengod的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/aliengod</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; aliengod]]></copyright><item><title><![CDATA[Commonly Used Linux Commands]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/115589763</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/115589763</guid><author>aliengod</author><pubDate>Sun, 11 Apr 2021 11:12:51 +0800</pubDate><description><![CDATA[Table of Contents1. Sed1.1.  Insert / Append1.2. Delete1.3. Replace2. Awk2.1.  Read different columns2.2.  Use customized separator2.3. Filter results by regular expressions

1. Sed
Here is an example test.txt file:
&gt; cat test.txt
hello world
hello worl]]></description><category></category></item><item><title><![CDATA[【Kubernetes学习系列】搭建Kubernetes集群]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/115425393</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/115425393</guid><author>aliengod</author><pubDate>Sun, 04 Apr 2021 13:16:21 +0800</pubDate><description><![CDATA[文章目录前言一、配置要求二、环境配置1. 主机名解析2. 同步时间3.  关闭防火墙 firewalld4. 关闭selinux5. 禁用Swap分区6. 修改Linux内核参数7. 开启ipvs8. 重启机器三、安装集群所需组件1.  安装Docker2. 安装kubeadm，kubelet和kubectl四、启动Master Node五、加入Worker Node到集群六、配置CNI网络模块七、配置kubectl自动补全

前言
鉴于目前市面上的云服务提供商已经提供Kubernetes云托管服务，比如G]]></description><category></category></item><item><title><![CDATA[Docker Study Part 1]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/115034003</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/115034003</guid><author>aliengod</author><pubDate>Sun, 21 Mar 2021 21:51:17 +0800</pubDate><description><![CDATA[Docker Tutorial
文章目录Docker TutorialWhat is DockerDocker v.s. Virtual MachineInstallation (CentOS 8)1. Check if Docker is already installed2. Install the tools3. Set up Docker repository4. Update the yum5. Install Docker6. Start Docker7. Test8. (Optional) U]]></description><category></category></item><item><title><![CDATA[UVA 1347. Tour 动态规划]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/107113522</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/107113522</guid><author>aliengod</author><pubDate>Fri, 03 Jul 2020 20:56:27 +0800</pubDate><description><![CDATA[Problem Description
John Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places.
To save money, John must determine the shortest closed tour that connects his destinations.
Each destination is]]></description><category></category></item><item><title><![CDATA[HDU 1024 Max Sum Plus Plus 动态规划]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/107102840</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/107102840</guid><author>aliengod</author><pubDate>Fri, 03 Jul 2020 12:44:04 +0800</pubDate><description><![CDATA[Problem Description
Now I think you have got an AC in Ignatius.L’s “Max Sum” problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.
Given a consecutive number sequence S1,S2,]]></description><category></category></item><item><title><![CDATA[POJ 3666. Making the Grade 数学证明及动态规划解法]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/107079074</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/107079074</guid><author>aliengod</author><pubDate>Thu, 02 Jul 2020 13:52:10 +0800</pubDate><description><![CDATA[POJ 3666. Making the Grade
题目链接
Description
A straight dirt road connects two fields on FJ’s farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond of an alternating succession]]></description><category></category></item><item><title><![CDATA[Leetcode Weekly 188 解题报告]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/107031185</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/107031185</guid><author>aliengod</author><pubDate>Tue, 30 Jun 2020 00:02:51 +0800</pubDate><description><![CDATA[文章目录Leetcode 1441. 用栈操作构建数组Leetcode 1442. 形成两个异或相等数组的三元组数目Leetcode 1443. 收集树上所有苹果的最少时间Leetcode 1444. 切披萨的方案数
Leetcode 1441. 用栈操作构建数组
题目链接
注意 “Push” / “Pop” 的大写即可。
class Solution {
    public List&lt;String&gt; buildArray(int[] target, int n) {
        List]]></description><category></category></item><item><title><![CDATA[Leetcode Weekly 187 解题报告]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/107027281</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/107027281</guid><author>aliengod</author><pubDate>Mon, 29 Jun 2020 21:41:34 +0800</pubDate><description><![CDATA[文章目录Leetcode 1436. Destination CityLeetcode 1437. Check If All 1's Are at Least Length K Places AwayLeetcode 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to LimitLeetcode 1439. Find the Kth Smallest Sum of a Matrix With Sorted Ro]]></description><category></category></item><item><title><![CDATA[Leetcode Weekly 195 解题报告]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/106999077</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/106999077</guid><author>aliengod</author><pubDate>Sun, 28 Jun 2020 15:53:09 +0800</pubDate><description><![CDATA[Leetcode 5448. Path Crossing
Leetcode 5449. Check If Array Pairs Are Divisible by k
Leetcode 5450. Number of Subsequences That Satisfy the Given Sum Condition
Leetcode 5451. Max Value of Equation
\newline
\newline
Leetcode 5448. Path Crossing
直接模拟这个过程即可，把走]]></description><category></category></item><item><title><![CDATA[Some problems about Topological Sort]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/106974933</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/106974933</guid><author>aliengod</author><pubDate>Fri, 26 Jun 2020 22:36:23 +0800</pubDate><description><![CDATA[Topological sort is an basic topic in graph theory, which is the foundation for many other problems like calculating strongly connected components (SCC). This article will discuss a couple of problems related to topological sort and its application. I will]]></description><category></category></item><item><title><![CDATA[Problems about removing some characters in a string to make it lexicographically smallest]]></title><link>https://blog.youkuaiyun.com/aliengod/article/details/106961222</link><guid>https://blog.youkuaiyun.com/aliengod/article/details/106961222</guid><author>aliengod</author><pubDate>Thu, 25 Jun 2020 21:59:41 +0800</pubDate><description><![CDATA[Problems about removing some characters in a string to make it lexicographically smallest
There are a bunch of problems in Leetcode about removing some characters / digits in a string to make it lexicographically smallest. Here i will have a discussion abo]]></description><category></category></item></channel></rss>