<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>JL BLOG</title>
    <description>This is my blog~</description>
    <link>https://JiefanLee.github.io/</link>
    <atom:link href="https://JiefanLee.github.io/feed.xml" rel="self" type="application/rss+xml"/>
    <pubDate>Thu, 24 May 2018 02:37:55 +0000</pubDate>
    <lastBuildDate>Thu, 24 May 2018 02:37:55 +0000</lastBuildDate>
    <generator>Jekyll v3.7.3</generator>
    
      <item>
        <title>链表主要功能实现</title>
        <description>
</description>
        <pubDate>Thu, 24 May 2018 10:28:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/24/LinkedList/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/24/LinkedList/</guid>
        
        <category>dataStructure</category>
        
        <category>sort</category>
        
        
        <category>dataStructure</category>
        
        <category>sort</category>
        
      </item>
    
      <item>
        <title>Sort</title>
        <description>
</description>
        <pubDate>Fri, 18 May 2018 20:52:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/18/QuickSort/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/18/QuickSort/</guid>
        
        <category>algorithm</category>
        
        <category>sort</category>
        
        
        <category>algorithm</category>
        
        <category>sort</category>
        
      </item>
    
      <item>
        <title>Convex</title>
        <description>
</description>
        <pubDate>Thu, 17 May 2018 00:00:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/17/convex/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/17/convex/</guid>
        
        
      </item>
    
      <item>
        <title>Search a 2D Matrix-Binary Search</title>
        <description>&lt;ul id=&quot;markdown-toc&quot;&gt;
  &lt;li&gt;&lt;a href=&quot;#search-a-2d-matrix&quot; id=&quot;markdown-toc-search-a-2d-matrix&quot;&gt;Search a 2D Matrix&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;h2 id=&quot;search-a-2d-matrix&quot;&gt;Search a 2D Matrix&lt;/h2&gt;

</description>
        <pubDate>Sun, 06 May 2018 18:52:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/06/binary-search/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/06/binary-search/</guid>
        
        <category>algorithm</category>
        
        <category>Binary</category>
        
        
        <category>algorithm</category>
        
        <category>Binary</category>
        
      </item>
    
      <item>
        <title>Permutation &amp; Combination</title>
        <description>&lt;ul id=&quot;markdown-toc&quot;&gt;
  &lt;li&gt;&lt;a href=&quot;#permutation&quot; id=&quot;markdown-toc-permutation&quot;&gt;Permutation&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;h2 id=&quot;permutation&quot;&gt;Permutation&lt;/h2&gt;

</description>
        <pubDate>Sun, 06 May 2018 16:44:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/06/permutation&combination/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/06/permutation&combination/</guid>
        
        <category>algorithm</category>
        
        <category>recursion</category>
        
        <category>LeetCode</category>
        
        
        <category>algorithm</category>
        
        <category>recursion</category>
        
        <category>LeetCode</category>
        
      </item>
    
      <item>
        <title>Two dimensional integer knapsack problem</title>
        <description>&lt;ul id=&quot;markdown-toc&quot;&gt;
  &lt;li&gt;&lt;a href=&quot;#two-dimensional-integer-knapsack-problem&quot; id=&quot;markdown-toc-two-dimensional-integer-knapsack-problem&quot;&gt;Two dimensional integer knapsack problem&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;h2 id=&quot;two-dimensional-integer-knapsack-problem&quot;&gt;Two dimensional integer knapsack problem&lt;/h2&gt;

</description>
        <pubDate>Sat, 05 May 2018 16:26:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/05/01package2dimension/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/05/01package2dimension/</guid>
        
        <category>algorithm</category>
        
        <category>DP</category>
        
        
        <category>algorithm</category>
        
        <category>DynamicProgramming</category>
        
      </item>
    
      <item>
        <title>约瑟夫问题</title>
        <description>
</description>
        <pubDate>Fri, 04 May 2018 10:20:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/04/%E7%BA%A6%E7%91%9F%E5%A4%AB%E9%97%AE%E9%A2%98/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/04/%E7%BA%A6%E7%91%9F%E5%A4%AB%E9%97%AE%E9%A2%98/</guid>
        
        <category>algorithm</category>
        
        
        <category>algorithm</category>
        
      </item>
    
      <item>
        <title>nQueens</title>
        <description>&lt;ul id=&quot;markdown-toc&quot;&gt;
  &lt;li&gt;&lt;a href=&quot;#nqueens&quot; id=&quot;markdown-toc-nqueens&quot;&gt;nQueens&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;h2 id=&quot;nqueens&quot;&gt;nQueens&lt;/h2&gt;

</description>
        <pubDate>Fri, 04 May 2018 08:06:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/04/nQueens/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/04/nQueens/</guid>
        
        <category>algorithm</category>
        
        <category>dfs</category>
        
        
        <category>algorithm</category>
        
        <category>dfs</category>
        
      </item>
    
      <item>
        <title>0-1Package</title>
        <description>&lt;ul id=&quot;markdown-toc&quot;&gt;
  &lt;li&gt;&lt;a href=&quot;#one-dimensional-01-knapsack-problem&quot; id=&quot;markdown-toc-one-dimensional-01-knapsack-problem&quot;&gt;one-dimensional 01 Knapsack Problem&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;h2 id=&quot;one-dimensional-01-knapsack-problem&quot;&gt;one-dimensional 01 Knapsack Problem&lt;/h2&gt;

</description>
        <pubDate>Thu, 03 May 2018 18:51:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/03/01package/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/03/01package/</guid>
        
        <category>algorithm</category>
        
        <category>DP</category>
        
        
        <category>algorithm</category>
        
        <category>DynamicProgramming</category>
        
      </item>
    
      <item>
        <title>Dijkstra</title>
        <description>
&lt;blockquote&gt;
  This is a very important and easy algorithm，I write this in case that I will forget it again in the future~
&lt;/blockquote&gt;

</description>
        <pubDate>Thu, 03 May 2018 12:45:00 +0000</pubDate>
        <link>https://JiefanLee.github.io/2018/05/03/Dijkstra/</link>
        <guid isPermaLink="true">https://JiefanLee.github.io/2018/05/03/Dijkstra/</guid>
        
        <category>algorithm</category>
        
        
        <category>algorithm</category>
        
      </item>
    
  </channel>
</rss>
