<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[King来写代码的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/King_Like_Coding</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; King_Like_Coding]]></copyright><item><title><![CDATA[计算机网络复习]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/73379666</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/73379666</guid><author>King_Like_Coding</author><pubDate>Sat, 17 Jun 2017 13:55:34 +0800</pubDate><description><![CDATA[计算机网络复习TCPIP
计算机网络基础
数据链路层
网络层
IP地址
网际协议
移动IP
网际控制报文协议
路由表
动态路由距离向量路由算法Bellman-Ford算法
动态路由链路状态路由算法Dijkstra算法
路由选择协议
传输层
传输控制协议TCP
用户数据报协议UDP
应用层
DNS
远程登录协议Telnet
文件传输协议FileTransfer ProtocolFTP
超文本传输协议H]]></description><category></category></item><item><title><![CDATA[算法与设计分析作业3(贪心)]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/54292248</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/54292248</guid><author>King_Like_Coding</author><pubDate>Mon, 09 Jan 2017 20:00:25 +0800</pubDate><description><![CDATA[算法与设计分析作业3贪心Greedy Algorithm
Pseudo-code
Prove the correctness
The complexity of your algorithm
Greedy Algorithm
Pseudo-code
Prove the correctness
The complexity of your algorithm
Programming
C Code
co]]></description><category></category></item><item><title><![CDATA[算法与设计分析作业2(动态规划)]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/53898573</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/53898573</guid><author>King_Like_Coding</author><pubDate>Tue, 27 Dec 2016 19:58:14 +0800</pubDate><description><![CDATA[算法与设计分析作业2动态规划Largest Divisible Subset
The optimal substructure and DP equation
Pseudo-code
Prove the correctness
The complexity of your algorithm
Money robbing
The optimal substructure and DP equation]]></description><category></category></item><item><title><![CDATA[LeetCode动态规划归纳]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52904122</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52904122</guid><author>King_Like_Coding</author><pubDate>Sun, 23 Oct 2016 20:14:59 +0800</pubDate><description><![CDATA[LeetCode动态规划归纳最近刷了很多动态规划的问题，归纳一下做动态规划的题的方法。动态规划很多题目是解决最多最少最大最小的问题。动态规划问题的基本做法是：
确定递推量
推出递推式
确定边界
在解决上述问题的同时，要时刻注意如何把全局的问题变成局部的（最优子结构），如何把前面计算过的子问题利用起来（重叠子问题）。下面把动态规划题分为几种类型。算种数的动态规划典型的题目包括：62.Unique Pa]]></description><category></category></item><item><title><![CDATA[32. Longest Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52737259</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52737259</guid><author>King_Like_Coding</author><pubDate>Wed, 05 Oct 2016 07:41:44 +0800</pubDate><description><![CDATA[Longest Valid ParenthesesGiven a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.For “(()”, the longest valid parentheses sub]]></description><category></category></item><item><title><![CDATA[算法与设计分析作业（分治）]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52737256</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52737256</guid><author>King_Like_Coding</author><pubDate>Wed, 05 Oct 2016 07:19:07 +0800</pubDate><description><![CDATA[算法与设计分析作业Divide and Conquer
problem-solving ideas
Pseudo-code
Subproblem reduction graph
Prove the correctness
Divide and Conquer
problem-solving ideas
Pseudo-code
Subproblem reduction graph
Prove the]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——10. Regular Expression Matching]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529620</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529620</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 21:15:26 +0800</pubDate><description><![CDATA[Regular Expression MatchingImplement regular expression matching with support for ‘.’ and ‘*’.‘.’ Matches any single character. 
‘*’ Matches zero or more of the preceding element.The matching should co]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——9. Palindrome Number]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529486</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529486</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 21:01:41 +0800</pubDate><description><![CDATA[Palindrome NumberDetermine whether an integer is a palindrome. Do this without extra space.解题思路：由于不能有额外的空间，所以可以参考上面的第7题倒转数字，根据回文的性质，倒转后的数字=原数字，注意倒转过程中不要使用额外的空间（除了必要的res）。代码如下：    bool isPalindrome(int]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——8. String to Integer (atoi)]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529426</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529426</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 20:56:33 +0800</pubDate><description><![CDATA[String to Integer (atoi)Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are th]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——7. Reverse Integer]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529391</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529391</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 20:52:54 +0800</pubDate><description><![CDATA[Reverse IntegerReverse digits of an integer.Example1: x = 123, return 321 
Example2: x = -123, return -321**spoilers： 
Have you thought about this? 
Here are some good questions to ask before coding. B]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——6. ZigZag Conversion]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529351</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529351</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 20:47:17 +0800</pubDate><description><![CDATA[ZigZag ConversionThe string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P   A   H]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——5.Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529192</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529192</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 20:29:07 +0800</pubDate><description><![CDATA[Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.解题思路：最长回文子串问题，很经典的问题。但一开始怎么]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——4. Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529125</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529125</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 20:21:16 +0800</pubDate><description><![CDATA[Median of Two Sorted ArraysThere are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Exam]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——3. Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529089</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52529089</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 20:17:10 +0800</pubDate><description><![CDATA[Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——2.Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52528742</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52528742</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 19:44:27 +0800</pubDate><description><![CDATA[Add Two NumbersYou are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retur]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ——1.Tow Sum]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52528653</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52528653</guid><author>King_Like_Coding</author><pubDate>Tue, 13 Sep 2016 19:31:49 +0800</pubDate><description><![CDATA[Tow SumGiven an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.*Example: 
Given nums = [2]]></description><category></category></item><item><title><![CDATA[操作系统知识点串联]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52073275</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/52073275</guid><author>King_Like_Coding</author><pubDate>Sat, 30 Jul 2016 16:07:22 +0800</pubDate><description><![CDATA[操作系统综述操作系统的发展可以分为 
手工操作阶段->脱机输入/输出技术->批处理技术->多道程序设计技术。 
在多道程序设计技术中，我们将一个以上的作业存放入主存，并且同时处于运行状态，这些状态共享处理器，外设以及其他资源。 
由于在实现多道程序系统时，主存同时中存在几道程序因此会出现一系列的问题： 
1. 如何分配处理器，以使处理器既能满足各个程序运行的需要又有较高的利用率。（处理器管理） 
2]]></description><category></category></item><item><title><![CDATA[01背包类型问题的两种解法]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/51866907</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/51866907</guid><author>King_Like_Coding</author><pubDate>Sat, 09 Jul 2016 15:45:54 +0800</pubDate><description><![CDATA[这里讲两道题目（类型均是01背包类型的），两道题目均用了回溯法和动态规划两种解决办法，做了以后还是有所启发的。 
　　第一道题目就是著名的01背包问题。 
　　01背包是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。求背包能放的最大价值。 
　　回溯法的解法：//0-1背包问题，假定n为8（总共有8种物品），M=110（总共能放的]]></description><category></category></item><item><title><![CDATA[算法复习笔记（回溯法，分支限界法）]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/51866084</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/51866084</guid><author>King_Like_Coding</author><pubDate>Sat, 09 Jul 2016 14:46:52 +0800</pubDate><description><![CDATA[回溯法
分支限界法回溯法　　回溯法（探索与回溯法）是一种选优搜索法，又称为试探法，按选优条件向前搜索，以达到目标。但当探索到某一步时，发现原先选择并不优或达不到目标，就退回一步重新选择，这种走不通就退回再走的技术为回溯法。 
　　基本思想： 
　　在包含问题的所有解的解空间树中，按照深度优先搜索的策略，从根结点出发深度探索解空间树。当探索到某一结点时，要先判断该结点是否包含问题的解，如果包含，就从该]]></description><category></category></item><item><title><![CDATA[算法复习笔记(分治法、动态规划、贪心算法)]]></title><link>https://blog.youkuaiyun.com/King_Like_Coding/article/details/51865450</link><guid>https://blog.youkuaiyun.com/King_Like_Coding/article/details/51865450</guid><author>King_Like_Coding</author><pubDate>Sat, 09 Jul 2016 11:35:43 +0800</pubDate><description><![CDATA[分治法
动态规划
贪心算法分治法　　分治法的基本思想是将一个规模为ｎ的问题分解为ｋ个规模较小的问题，这些子问题互相独立且与原问题相同（所以可以递归）。递归地解这些子问题，然后将各个子问题的解合并得到原问题的解。它的一般算法设计模式如下：divide-and-conquer(P)
{
//|P|表示问题的规模，n0表示阈值，当规模不超过n0时，问题容易解出，不必分解
    if(|P|<=n0)]]></description><category></category></item></channel></rss>