<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">


    
  <url>
    <loc>https://linjiafengyang.github.io/2018/10/09/%E8%80%83%E7%A0%94%E8%8B%B1%E8%AF%AD%E4%BA%8C%E7%9C%9F%E9%A2%98%E8%AF%8D%E6%B1%87%E6%95%B4%E7%90%86/</loc>
    <lastmod>2018-12-09T11:40:02.719Z</lastmod>
    <data>
        <display>
        <title>考研英语二真题词汇整理</title>
        <pubTime>2018-10-09T15:38:20.000Z</pubTime>
        
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/11/17/408%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%A6%E7%A7%91%E4%B8%93%E4%B8%9A%E5%9F%BA%E7%A1%80%E7%BB%BC%E5%90%88%E2%80%94%E2%80%94%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/</loc>
    <lastmod>2018-11-18T13:57:50.354Z</lastmod>
    <data>
        <display>
        <title>408计算机学科专业基础综合——计算机网络</title>
        <pubTime>2018-11-17T02:39:48.000Z</pubTime>
        
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/11/14/408%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%A6%E7%A7%91%E4%B8%93%E4%B8%9A%E5%9F%BA%E7%A1%80%E7%BB%BC%E5%90%88%E2%80%94%E2%80%94%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/</loc>
    <lastmod>2018-11-15T10:49:17.587Z</lastmod>
    <data>
        <display>
        <title>408计算机学科专业基础综合——操作系统</title>
        <pubTime>2018-11-14T15:33:15.000Z</pubTime>
        
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/11/12/408%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%A6%E7%A7%91%E4%B8%93%E4%B8%9A%E5%9F%BA%E7%A1%80%E7%BB%BC%E5%90%88%E2%80%94%E2%80%94%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BB%84%E6%88%90%E5%8E%9F%E7%90%86/</loc>
    <lastmod>2018-11-14T15:29:31.311Z</lastmod>
    <data>
        <display>
        <title>408计算机学科专业基础综合——计算机组成原理</title>
        <pubTime>2018-11-12T15:38:01.000Z</pubTime>
        
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/11/10/408%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%A6%E7%A7%91%E4%B8%93%E4%B8%9A%E5%9F%BA%E7%A1%80%E7%BB%BC%E5%90%88%E2%80%94%E2%80%94%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/</loc>
    <lastmod>2018-11-12T15:26:41.285Z</lastmod>
    <data>
        <display>
        <title>408计算机学科专业基础综合——数据结构</title>
        <pubTime>2018-11-10T13:35:03.000Z</pubTime>
        
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/06/26/%E6%95%B0%E6%8D%AE%E6%8C%96%E6%8E%98%E4%BD%9C%E4%B8%9A%E4%B8%89%EF%BC%9A%E4%B8%BB%E6%88%90%E5%88%86%E5%88%86%E6%9E%90%E3%80%81%E6%8E%A8%E8%8D%90%E7%B3%BB%E7%BB%9F%E5%92%8C%E5%85%B3%E8%81%94%E8%A7%84%E5%88%99/</loc>
    <lastmod>2018-06-26T15:53:48.715Z</lastmod>
    <data>
        <display>
        <title>数据挖掘作业三：主成分分析、推荐系统和关联规则</title>
        <pubTime>2018-06-26T15:48:12.000Z</pubTime>
        
        <tag>Python</tag>
         
         
           
             
              <breadCrumb title="机器学习" url="https://linjiafengyang.github.io/categories/%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/06/21/Ex6%EF%BC%9A%E5%9B%BE%E5%83%8F%E6%8B%BC%E6%8E%A5/</loc>
    <lastmod>2018-06-21T08:35:59.360Z</lastmod>
    <data>
        <display>
        <title>Ex6：图像拼接</title>
        <pubTime>2018-06-21T08:28:06.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="计算机视觉" url="https://linjiafengyang.github.io/categories/%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%86%E8%A7%89/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/04/27/pandas%E5%92%8Cnumpy%E7%AC%94%E8%AE%B0%EF%BC%88%E4%B8%8D%E6%96%AD%E6%9B%B4%E6%96%B0%EF%BC%89/</loc>
    <lastmod>2018-06-12T16:12:56.940Z</lastmod>
    <data>
        <display>
        <title>pandas和numpy笔记（不断更新）</title>
        <pubTime>2018-04-27T15:36:52.000Z</pubTime>
        
        <tag>Python</tag>
         
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/06/12/%E5%A4%87%E5%BF%98%E5%BD%95%EF%BC%9Agithub%E4%B8%8Bfork%E5%90%8E%E5%A6%82%E4%BD%95%E5%90%8C%E6%AD%A5%E6%BA%90%E7%9A%84%E6%96%B0%E6%9B%B4%E6%96%B0%E5%86%85%E5%AE%B9%EF%BC%9F/</loc>
    <lastmod>2018-06-12T15:59:34.511Z</lastmod>
    <data>
        <display>
        <title>备忘录：github下fork后如何同步源的新更新内容？</title>
        <pubTime>2018-06-12T15:56:09.000Z</pubTime>
        
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/05/20/Ex5%EF%BC%9A%E5%9B%BE%E5%83%8F%E5%88%86%E5%89%B2/</loc>
    <lastmod>2018-05-20T14:54:46.812Z</lastmod>
    <data>
        <display>
        <title>Ex5：图像分割</title>
        <pubTime>2018-05-20T14:51:39.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="计算机视觉" url="https://linjiafengyang.github.io/categories/%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%86%E8%A7%89/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/05/11/Ex4%EF%BC%9AImage-Warping-and-Image-Morphing/</loc>
    <lastmod>2018-05-11T03:18:06.957Z</lastmod>
    <data>
        <display>
        <title>Ex4：Image Warping and Image Morphing</title>
        <pubTime>2018-05-11T03:13:55.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="计算机视觉" url="https://linjiafengyang.github.io/categories/%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%86%E8%A7%89/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/05/06/%E6%95%B0%E6%8D%AE%E6%8C%96%E6%8E%98%E4%BD%9C%E4%B8%9A%E4%BA%8C%EF%BC%9A%E6%A8%A1%E5%9E%8B%E7%9A%84%E6%80%A7%E8%83%BD%E5%BA%A6%E9%87%8F%E3%80%81%E7%A5%9E%E7%BB%8F%E7%BD%91%E7%BB%9C%E5%92%8C%E5%86%B3%E7%AD%96%E6%A0%91/</loc>
    <lastmod>2018-05-06T11:01:36.309Z</lastmod>
    <data>
        <display>
        <title>数据挖掘作业二：模型的性能度量、神经网络和决策树</title>
        <pubTime>2018-05-06T10:53:10.000Z</pubTime>
        
        <tag>Python</tag>
         
         
           
             
              <breadCrumb title="机器学习" url="https://linjiafengyang.github.io/categories/%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/04/29/Ex3%EF%BC%9A%E9%9C%8D%E5%A4%AB%E5%8F%98%E6%8D%A2%E7%AE%97%E6%B3%95%E5%AE%9E%E7%8E%B0A4%E7%BA%B8%E7%9B%B4%E7%BA%BF%E6%A3%80%E6%B5%8B%E5%92%8C%E7%A1%AC%E5%B8%81%E5%9C%86%E5%BD%A2%E6%A3%80%E6%B5%8B-%E4%BD%BF%E7%94%A8CImg%E5%BA%93/</loc>
    <lastmod>2018-04-29T03:38:31.134Z</lastmod>
    <data>
        <display>
        <title>Ex3：霍夫变换算法实现A4纸直线检测和硬币圆形检测(使用CImg库)</title>
        <pubTime>2018-04-29T03:32:32.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="计算机视觉" url="https://linjiafengyang.github.io/categories/%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%86%E8%A7%89/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/04/10/%E6%95%B0%E6%8D%AE%E6%8C%96%E6%8E%98%E4%BD%9C%E4%B8%9A%E4%B8%80%EF%BC%9A%E7%BA%BF%E6%80%A7%E5%9B%9E%E5%BD%92%E3%80%81%E9%80%BB%E8%BE%91%E5%9B%9E%E5%BD%92%E5%92%8C%E6%94%AF%E6%8C%81%E5%90%91%E9%87%8F%E6%9C%BA/</loc>
    <lastmod>2018-04-10T09:53:47.619Z</lastmod>
    <data>
        <display>
        <title>数据挖掘作业一：线性回归、逻辑回归和支持向量机</title>
        <pubTime>2018-04-10T09:34:17.000Z</pubTime>
        
        <tag>Python</tag>
         
         
           
             
              <breadCrumb title="机器学习" url="https://linjiafengyang.github.io/categories/%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/04/10/Ex2%EF%BC%9A%E7%94%A8CImg%E9%87%8D%E5%86%99%E3%80%81%E5%B0%81%E8%A3%85%E7%BB%99%E5%AE%9A%E7%9A%84Canny%E4%BB%A3%E7%A0%81%EF%BC%8C%E5%B9%B6%E6%B5%8B%E8%AF%95/</loc>
    <lastmod>2018-04-10T08:31:24.415Z</lastmod>
    <data>
        <display>
        <title>Ex2：用CImg重写、封装给定的Canny代码，并测试</title>
        <pubTime>2018-04-10T08:06:46.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="计算机视觉" url="https://linjiafengyang.github.io/categories/%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%86%E8%A7%89/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/04/10/Ex1%EF%BC%9A%E5%9B%BE%E5%83%8F%E8%AF%BB%E5%8F%96%E5%92%8C%E6%98%BE%E7%A4%BA%E4%BB%A5%E5%8F%8A%E5%83%8F%E7%B4%A0%E6%93%8D%E4%BD%9C/</loc>
    <lastmod>2018-04-10T07:39:23.532Z</lastmod>
    <data>
        <display>
        <title>Ex1：图像读取和显示以及像素操作</title>
        <pubTime>2018-04-10T07:12:33.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="计算机视觉" url="https://linjiafengyang.github.io/categories/%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%86%E8%A7%89/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/26/%E6%B5%85%E8%B0%88Python2%E5%92%8CPython3%E7%9A%84%E5%8C%BA%E5%88%AB/</loc>
    <lastmod>2018-04-10T04:18:01.821Z</lastmod>
    <data>
        <display>
        <title>浅谈Python2和Python3的区别</title>
        <pubTime>2018-02-26T09:54:11.000Z</pubTime>
        
        <tag>Python</tag>
         
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/03/11/%E8%A7%A3%E5%86%B3%E4%BD%BF%E7%94%A8CImg%E9%81%87%E5%88%B0%E7%9A%84%E9%97%AE%E9%A2%98%EF%BC%9A%E6%97%A0%E6%B3%95%E5%8A%A0%E8%BD%BDjpg%E5%9B%BE%E5%83%8F/</loc>
    <lastmod>2018-03-11T15:42:15.700Z</lastmod>
    <data>
        <display>
        <title>解决使用CImg遇到的问题：无法加载jpg图像</title>
        <pubTime>2018-03-11T15:33:05.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/03/11/%E8%A7%A3%E5%86%B3%E4%BD%BF%E7%94%A8CImg%E9%81%87%E5%88%B0%E7%9A%84%E9%97%AE%E9%A2%98%EF%BC%9Aundefined-reference-to-imp-SetDIBitsToDevice/</loc>
    <lastmod>2018-03-11T15:22:06.915Z</lastmod>
    <data>
        <display>
        <title>解决使用CImg遇到的问题：undefined reference to __imp_SetDIBitsToDevice</title>
        <pubTime>2018-03-11T15:16:00.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/28/Python%E5%AD%A6%E4%B9%A0%E7%AC%94%E8%AE%B0%EF%BC%9A%E5%AD%97%E7%AC%A6%E4%B8%B2/</loc>
    <lastmod>2018-02-28T12:28:17.416Z</lastmod>
    <data>
        <display>
        <title>Python学习笔记：字符串</title>
        <pubTime>2018-02-28T12:27:25.000Z</pubTime>
        
        <tag>Python</tag>
         
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/23/LeetCode-42-Trapping-Rain-Water/</loc>
    <lastmod>2018-02-23T14:04:54.683Z</lastmod>
    <data>
        <display>
        <title>LeetCode 42. Trapping Rain Water</title>
        <pubTime>2018-02-23T13:54:02.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/08/LeetCode-41-First-Missing-Positive/</loc>
    <lastmod>2018-02-08T13:36:19.442Z</lastmod>
    <data>
        <display>
        <title>LeetCode 41. First Missing Positive</title>
        <pubTime>2018-02-08T13:35:46.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/08/LeetCode-39-Combination-Sum/</loc>
    <lastmod>2018-02-08T12:33:20.758Z</lastmod>
    <data>
        <display>
        <title>LeetCode 39. Combination Sum</title>
        <pubTime>2018-02-08T06:12:38.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/08/LeetCode-34-Search-for-a-Range/</loc>
    <lastmod>2018-02-08T05:28:53.210Z</lastmod>
    <data>
        <display>
        <title>LeetCode 34. Search for a Range</title>
        <pubTime>2018-02-08T05:28:19.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/07/LeetCode-33-Search-in-Rotated-Sorted-Array/</loc>
    <lastmod>2018-02-07T14:47:33.023Z</lastmod>
    <data>
        <display>
        <title>LeetCode 33. Search in Rotated Sorted Array</title>
        <pubTime>2018-02-07T14:46:55.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/07/LeetCode-31-NextPermutation/</loc>
    <lastmod>2018-02-07T13:36:30.420Z</lastmod>
    <data>
        <display>
        <title>LeetCode 31.NextPermutation</title>
        <pubTime>2018-02-07T13:18:27.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/02/02/VSCode%E9%85%8D%E7%BD%AELaTeX-Workstation%E4%BB%A5%E6%94%AF%E6%8C%81%E4%B8%AD%E6%96%87/</loc>
    <lastmod>2018-02-02T12:20:59.837Z</lastmod>
    <data>
        <display>
        <title>VSCode配置LaTeX Workstation以支持中文</title>
        <pubTime>2018-02-02T12:11:18.000Z</pubTime>
        
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/%E7%94%B1LeetCode-1-Two-Sum%E5%BC%95%E8%B5%B7%E7%9A%84%E5%87%A0%E4%B8%AA%E9%97%AE%E9%A2%98/</loc>
    <lastmod>2018-02-01T06:02:07.599Z</lastmod>
    <data>
        <display>
        <title>由LeetCode 1.Two Sum引起的几个问题</title>
        <pubTime>2017-12-10T06:01:38.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E5%B0%8F%E6%98%93%E8%AE%B0%E5%8D%95%E8%AF%8D/</loc>
    <lastmod>2018-02-01T06:00:48.180Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——小易记单词</title>
        <pubTime>2018-01-23T12:52:06.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E5%B7%A5%E4%BD%9C%E5%AE%89%E6%8E%92/</loc>
    <lastmod>2018-02-01T06:00:18.302Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——工作安排</title>
        <pubTime>2018-01-23T11:48:08.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E8%B5%B6%E5%8E%BB%E5%85%AC%E5%8F%B8/</loc>
    <lastmod>2018-02-01T05:59:52.176Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——赶去公司</title>
        <pubTime>2018-01-23T09:44:22.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E9%9B%86%E5%90%88/</loc>
    <lastmod>2018-02-01T05:59:24.639Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——集合</title>
        <pubTime>2018-01-23T12:05:30.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E5%A5%87%E6%80%AA%E7%9A%84%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B1%82%E5%80%BC/</loc>
    <lastmod>2018-02-01T05:58:27.120Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——奇怪的表达式求值</title>
        <pubTime>2018-01-23T12:29:20.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E5%8F%8C%E6%A0%B8%E5%A4%84%E7%90%86/</loc>
    <lastmod>2018-02-01T05:57:51.722Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——双核处理</title>
        <pubTime>2018-01-23T09:17:06.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E8%B0%83%E6%95%B4%E9%98%9F%E5%BD%A2/</loc>
    <lastmod>2018-02-01T05:57:26.170Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——调整队形</title>
        <pubTime>2018-01-23T10:52:03.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E6%B6%82%E6%A3%8B%E7%9B%98/</loc>
    <lastmod>2018-02-01T05:56:58.052Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——涂棋盘</title>
        <pubTime>2018-01-23T12:41:09.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/23/%E7%BD%91%E6%98%932017%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95%E2%80%94%E2%80%94%E6%B6%88%E9%99%A4%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0/</loc>
    <lastmod>2018-02-01T05:56:29.406Z</lastmod>
    <data>
        <display>
        <title>网易2017春招笔试——消除重复元素</title>
        <pubTime>2018-01-23T11:05:53.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017网易春招笔试" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%BD%91%E6%98%93%E6%98%A5%E6%8B%9B%E7%AC%94%E8%AF%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/06/%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E7%BB%83%E4%B9%A0%E2%80%94%E2%80%941006-%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E4%B8%B2/</loc>
    <lastmod>2018-02-01T05:55:16.230Z</lastmod>
    <data>
        <display>
        <title>算法期中练习——1006. 最长公共子串</title>
        <pubTime>2018-01-06T03:21:49.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017算法期中考" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E8%80%83/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/05/%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E7%BB%83%E4%B9%A0%E2%80%94%E2%80%941000-%E5%88%86%E7%BB%84/</loc>
    <lastmod>2018-02-01T05:55:03.892Z</lastmod>
    <data>
        <display>
        <title>算法期中练习——1000.分组</title>
        <pubTime>2018-01-05T13:54:27.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017算法期中考" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E8%80%83/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/05/%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E7%BB%83%E4%B9%A0%E2%80%94%E2%80%941001-%E6%9C%80%E5%B0%8F%E5%B7%AE/</loc>
    <lastmod>2018-02-01T05:54:40.227Z</lastmod>
    <data>
        <display>
        <title>算法期中练习——1001. 最小差</title>
        <pubTime>2018-01-05T13:55:14.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017算法期中考" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E8%80%83/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/05/%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E7%BB%83%E4%B9%A0%E2%80%94%E2%80%941002-%E5%90%88%E5%B9%B6%E4%BA%8C%E5%8F%89%E6%A0%91/</loc>
    <lastmod>2018-02-01T05:54:22.361Z</lastmod>
    <data>
        <display>
        <title>算法期中练习——1002. 合并二叉树</title>
        <pubTime>2018-01-05T13:55:53.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017算法期中考" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E8%80%83/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/06/%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E7%BB%83%E4%B9%A0%E2%80%94%E2%80%941003-%E6%9C%80%E8%BF%91%E7%9A%840/</loc>
    <lastmod>2018-02-01T05:54:02.589Z</lastmod>
    <data>
        <display>
        <title>算法期中练习——1003. 最近的0</title>
        <pubTime>2018-01-05T16:39:31.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017算法期中考" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E8%80%83/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/06/%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E7%BB%83%E4%B9%A0%E2%80%94%E2%80%941004-%E6%8B%93%E6%89%91%E5%BA%8F/</loc>
    <lastmod>2018-02-01T05:53:26.332Z</lastmod>
    <data>
        <display>
        <title>算法期中练习——1004. 拓扑序</title>
        <pubTime>2018-01-05T16:41:11.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017算法期中考" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E8%80%83/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/06/%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E7%BB%83%E4%B9%A0%E2%80%94%E2%80%941005-%E6%9C%80%E5%B0%8F%E5%92%8C/</loc>
    <lastmod>2018-02-01T05:52:30.580Z</lastmod>
    <data>
        <display>
        <title>算法期中练习——1005. 最小和</title>
        <pubTime>2018-01-06T03:08:47.000Z</pubTime>
        
        <tag>CPP</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="2017算法期中考" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/2017%E7%AE%97%E6%B3%95%E6%9C%9F%E4%B8%AD%E8%80%83/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/25/LeetCode-746-Min-Cost-Climbing-Stairs/</loc>
    <lastmod>2018-02-01T05:51:05.987Z</lastmod>
    <data>
        <display>
        <title>LeetCode 746. Min Cost Climbing Stairs</title>
        <pubTime>2017-12-25T08:17:24.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-628-Maximum-Product-of-Three-Numbers/</loc>
    <lastmod>2018-02-01T05:50:40.931Z</lastmod>
    <data>
        <display>
        <title>LeetCode 628. Maximum Product of Three Numbers</title>
        <pubTime>2017-12-10T06:17:19.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-643-Maximum-Average-Subarray-%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E5%9D%87%E5%80%BC/</loc>
    <lastmod>2018-02-01T05:50:23.688Z</lastmod>
    <data>
        <display>
        <title>LeetCode 643.Maximum Average Subarray 最大子数组的平均值</title>
        <pubTime>2017-12-10T06:15:24.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-673-Number-of-Longest-Increasing-Subsequence/</loc>
    <lastmod>2018-02-01T05:49:41.547Z</lastmod>
    <data>
        <display>
        <title>LeetCode 673.Number of Longest Increasing Subsequence</title>
        <pubTime>2017-12-10T06:13:08.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-674-Longest-Continuous-Increasing-Subsequence/</loc>
    <lastmod>2018-02-01T05:49:08.529Z</lastmod>
    <data>
        <display>
        <title>LeetCode 674.Longest Continuous Increasing Subsequence</title>
        <pubTime>2017-12-10T06:12:09.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/22/LeetCode-690-Employee-Importance/</loc>
    <lastmod>2018-02-01T05:48:35.214Z</lastmod>
    <data>
        <display>
        <title>LeetCode 690.Employee Importance</title>
        <pubTime>2017-12-22T13:09:05.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-695-Max-Area-of-Island/</loc>
    <lastmod>2018-02-01T05:48:13.134Z</lastmod>
    <data>
        <display>
        <title>LeetCode 695. Max Area of Island</title>
        <pubTime>2017-12-10T06:11:18.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-697-Degree-of-an-Array/</loc>
    <lastmod>2018-02-01T05:47:39.136Z</lastmod>
    <data>
        <display>
        <title>LeetCode 697. Degree of an Array</title>
        <pubTime>2017-12-10T06:10:24.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/24/LeetCode-733-Flood-Fill/</loc>
    <lastmod>2018-02-01T05:46:55.035Z</lastmod>
    <data>
        <display>
        <title>LeetCode 733. Flood Fill</title>
        <pubTime>2017-12-24T15:37:38.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-566-Reshape-the-Matrix/</loc>
    <lastmod>2018-02-01T05:46:12.913Z</lastmod>
    <data>
        <display>
        <title>LeetCode 566.Reshape the Matrix</title>
        <pubTime>2017-12-10T06:18:16.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-414-Third-Maximum-Number/</loc>
    <lastmod>2018-02-01T05:44:24.675Z</lastmod>
    <data>
        <display>
        <title>LeetCode 414.Third Maximum Number</title>
        <pubTime>2017-12-10T05:44:51.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-442-Find-All-Duplicates-in-an-Array/</loc>
    <lastmod>2018-02-01T05:43:56.136Z</lastmod>
    <data>
        <display>
        <title>LeetCode 442.Find All Duplicates in an Array</title>
        <pubTime>2017-12-10T06:20:49.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-448-Find-All-Numbers-Disappeared-in-an-Array/</loc>
    <lastmod>2018-02-01T05:43:41.127Z</lastmod>
    <data>
        <display>
        <title>LeetCode 448.Find All Numbers Disappeared in an Array</title>
        <pubTime>2017-12-10T06:19:51.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-561-Array-Partition-I/</loc>
    <lastmod>2018-02-01T05:43:27.208Z</lastmod>
    <data>
        <display>
        <title>LeetCode 561.Array Partition I</title>
        <pubTime>2017-12-10T06:19:04.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/11/LeetCode-283-Move-Zeroes/</loc>
    <lastmod>2018-02-01T05:42:17.893Z</lastmod>
    <data>
        <display>
        <title>LeetCode 283.Move Zeroes</title>
        <pubTime>2017-12-11T09:23:48.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/12/LeetCode-219-Contains-Duplicate-II/</loc>
    <lastmod>2018-02-01T05:41:57.338Z</lastmod>
    <data>
        <display>
        <title>LeetCode 219.Contains Duplicate II</title>
        <pubTime>2017-12-12T00:40:39.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/24/LeetCode-215-Kth-Largest-Element-in-an-Array/</loc>
    <lastmod>2018-02-01T05:41:28.976Z</lastmod>
    <data>
        <display>
        <title>LeetCode 215. Kth Largest Element in an Array</title>
        <pubTime>2017-12-24T15:46:27.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/12/LeetCode-240-Search-a-2D-Matrix-II/</loc>
    <lastmod>2018-02-01T05:41:20.920Z</lastmod>
    <data>
        <display>
        <title>LeetCode 240. Search a 2D Matrix II</title>
        <pubTime>2018-01-12T13:44:47.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/22/LeetCode-257-Binary-Tree-Paths/</loc>
    <lastmod>2018-02-01T05:41:05.650Z</lastmod>
    <data>
        <display>
        <title>LeetCode 257. Binary Tree Paths</title>
        <pubTime>2017-12-22T06:58:49.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/11/LeetCode-268-Missing-Number/</loc>
    <lastmod>2018-02-01T05:40:49.185Z</lastmod>
    <data>
        <display>
        <title>LeetCode 268.Missing Number</title>
        <pubTime>2017-12-11T11:49:17.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/01/LeetCode-278-First-Bad-Version/</loc>
    <lastmod>2018-02-01T05:40:33.234Z</lastmod>
    <data>
        <display>
        <title>LeetCode 278. First Bad Version</title>
        <pubTime>2018-01-01T08:31:01.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/25/LeetCode-198-House-Robber/</loc>
    <lastmod>2018-02-01T05:39:45.595Z</lastmod>
    <data>
        <display>
        <title>LeetCode 198. House Robber</title>
        <pubTime>2017-12-25T11:54:14.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/19/LeetCode-112-Path-Sum/</loc>
    <lastmod>2018-02-01T05:39:21.558Z</lastmod>
    <data>
        <display>
        <title>LeetCode 112. Path Sum</title>
        <pubTime>2017-12-19T00:46:38.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/19/LeetCode-113-Path-Sum-II/</loc>
    <lastmod>2018-02-01T05:38:59.914Z</lastmod>
    <data>
        <display>
        <title>LeetCode 113. Path Sum II</title>
        <pubTime>2017-12-19T01:24:19.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/14/LeetCode-118-Pascal-s-Triangle/</loc>
    <lastmod>2018-02-01T05:38:41.031Z</lastmod>
    <data>
        <display>
        <title>LeetCode 118. Pascal's Triangle</title>
        <pubTime>2017-12-14T11:23:46.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/14/LeetCode-119-Pascal-s-Triangle-II/</loc>
    <lastmod>2018-02-01T05:38:17.874Z</lastmod>
    <data>
        <display>
        <title>LeetCode 119. Pascal's Triangle II</title>
        <pubTime>2017-12-14T11:55:29.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/13/LeetCode-122-Best-Time-to-Buy-and-Sell-Stock-II/</loc>
    <lastmod>2018-02-01T05:38:06.347Z</lastmod>
    <data>
        <display>
        <title>LeetCode 122. Best Time to Buy and Sell Stock II</title>
        <pubTime>2017-12-13T11:40:30.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/11/LeetCode-136-Single-Number/</loc>
    <lastmod>2018-02-01T05:37:54.009Z</lastmod>
    <data>
        <display>
        <title>LeetCode 136.Single Number</title>
        <pubTime>2017-12-11T12:29:29.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-152-Maximum-Product-Subarray/</loc>
    <lastmod>2018-02-01T05:37:35.833Z</lastmod>
    <data>
        <display>
        <title>LeetCode 152.Maximum Product Subarray</title>
        <pubTime>2017-12-10T06:16:13.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-169-Majority-Element-and-LeetCode-229-Majority-Element-II%E8%A7%A3%E9%A2%98%E6%8A%A5%E5%91%8A/</loc>
    <lastmod>2018-02-01T05:37:02.430Z</lastmod>
    <data>
        <display>
        <title>LeetCode 169. Majority Element and LeetCode 229. Majority Element II解题报告</title>
        <pubTime>2017-12-10T05:52:53.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/12/LeetCode-189-Rotate-Array/</loc>
    <lastmod>2018-02-01T05:35:32.606Z</lastmod>
    <data>
        <display>
        <title>LeetCode 189.Rotate Array</title>
        <pubTime>2017-12-12T01:20:08.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/18/LeetCode-111-Minimum-Depth-of-Binary-Tree/</loc>
    <lastmod>2018-02-01T05:34:47.575Z</lastmod>
    <data>
        <display>
        <title>LeetCode 111. Minimum Depth of Binary Tree</title>
        <pubTime>2017-12-18T06:34:25.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/16/LeetCode-100-Same-Tree/</loc>
    <lastmod>2018-02-01T05:34:36.137Z</lastmod>
    <data>
        <display>
        <title>LeetCode 100.Same Tree</title>
        <pubTime>2017-12-16T11:29:51.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/16/LeetCode-101-Symmetric-Tree/</loc>
    <lastmod>2018-02-01T05:34:00.689Z</lastmod>
    <data>
        <display>
        <title>LeetCode 101. Symmetric Tree</title>
        <pubTime>2017-12-16T13:15:13.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/18/LeetCode-104-Maximum-Depth-of-Binary-Tree/</loc>
    <lastmod>2018-02-01T05:33:23.973Z</lastmod>
    <data>
        <display>
        <title>LeetCode 104. Maximum Depth of Binary Tree</title>
        <pubTime>2017-12-18T01:43:02.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/18/LeetCode-108-Convert-Sorted-Array-to-Binary-Search-Tree/</loc>
    <lastmod>2018-02-01T05:32:58.085Z</lastmod>
    <data>
        <display>
        <title>LeetCode 108. Convert Sorted Array to Binary Search Tree</title>
        <pubTime>2017-12-18T07:40:12.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/18/LeetCode-109-Convert-Sorted-List-to-Binary-Search-Tree/</loc>
    <lastmod>2018-02-01T05:31:20.139Z</lastmod>
    <data>
        <display>
        <title>LeetCode 109. Convert Sorted List to Binary Search Tree</title>
        <pubTime>2017-12-18T12:59:25.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/18/LeetCode-110-Balanced-Binary-Tree/</loc>
    <lastmod>2018-02-01T05:30:52.641Z</lastmod>
    <data>
        <display>
        <title>LeetCode 110. Balanced Binary Tree</title>
        <pubTime>2017-12-18T06:20:20.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-53-Maximum-Subarray-and-121-Best-Time-to-Buy-and-Sell-Stock%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E9%97%AE%E9%A2%98/</loc>
    <lastmod>2018-02-01T05:29:35.772Z</lastmod>
    <data>
        <display>
        <title>LeetCode 53. Maximum Subarray and 121. Best Time to Buy and Sell Stock最大子数组问题</title>
        <pubTime>2017-12-10T05:59:34.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/12/LeetCode-55-Jump-Game/</loc>
    <lastmod>2018-02-01T05:27:38.417Z</lastmod>
    <data>
        <display>
        <title>LeetCode 55. Jump Game</title>
        <pubTime>2018-01-12T12:29:51.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/12/LeetCode-62-Unique-Paths/</loc>
    <lastmod>2018-02-01T05:27:21.518Z</lastmod>
    <data>
        <display>
        <title>LeetCode 62. Unique Paths</title>
        <pubTime>2018-01-12T12:56:08.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/12/LeetCode-63-Unique-Paths-II/</loc>
    <lastmod>2018-02-01T05:26:40.363Z</lastmod>
    <data>
        <display>
        <title>LeetCode 63. Unique Paths II</title>
        <pubTime>2018-01-12T13:11:19.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/01/LeetCode-69-Sqrt-x/</loc>
    <lastmod>2018-02-01T05:26:23.257Z</lastmod>
    <data>
        <display>
        <title>LeetCode 69. Sqrt(x)</title>
        <pubTime>2018-01-01T08:13:30.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/25/LeetCode-70-Climbing-Stairs/</loc>
    <lastmod>2018-02-01T05:25:43.820Z</lastmod>
    <data>
        <display>
        <title>LeetCode 70. Climbing Stairs</title>
        <pubTime>2017-12-25T06:54:55.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/14/LeetCode-88-Merge-Sorted-Array/</loc>
    <lastmod>2018-02-01T05:24:53.925Z</lastmod>
    <data>
        <display>
        <title>LeetCode 88. Merge Sorted Array</title>
        <pubTime>2017-12-14T12:46:03.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/12/LeetCode-74-Search-a-2D-Matrix/</loc>
    <lastmod>2018-02-01T05:20:10.989Z</lastmod>
    <data>
        <display>
        <title>LeetCode 74. Search a 2D Matrix</title>
        <pubTime>2018-01-12T13:23:30.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/11/LeetCode-27-Remove-Element/</loc>
    <lastmod>2018-01-31T17:37:42.113Z</lastmod>
    <data>
        <display>
        <title>LeetCode 27.Remove Element</title>
        <pubTime>2017-12-11T10:50:23.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/12/LeetCode-26-Remove-Duplicates-from-Sorted-Array/</loc>
    <lastmod>2018-01-31T17:37:27.682Z</lastmod>
    <data>
        <display>
        <title>LeetCode 26.Remove Duplicates from Sorted Array</title>
        <pubTime>2017-12-12T01:44:32.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/14/LeetCode-35-Search-Insert-Position/</loc>
    <lastmod>2018-01-31T17:37:08.439Z</lastmod>
    <data>
        <display>
        <title>LeetCode 35. Search Insert Position</title>
        <pubTime>2017-12-14T15:31:45.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-2-Add-Two-Numbers-67-Add-Binary-371-Sum-of-Two-Integers-66-Plus-One/</loc>
    <lastmod>2018-01-31T17:36:52.345Z</lastmod>
    <data>
        <display>
        <title>LeetCode 2.Add Two Numbers,67.Add Binary,371.Sum of Two Integers,66.Plus One</title>
        <pubTime>2017-12-10T06:04:11.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/31/LeetCode-4-Median-of-Two-Sorted-Arrays/</loc>
    <lastmod>2018-01-31T17:35:09.989Z</lastmod>
    <data>
        <display>
        <title>LeetCode 4. Median of Two Sorted Arrays</title>
        <pubTime>2018-01-31T07:23:38.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-7-Reverse-Integer-and-8-String-to-Integer-atoi/</loc>
    <lastmod>2018-01-31T17:32:14.233Z</lastmod>
    <data>
        <display>
        <title>LeetCode 7.Reverse Integer and 8.String to Integer(atoi)</title>
        <pubTime>2017-12-10T06:05:30.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-9-Palindrome-Number%E5%9B%9E%E6%96%87%E6%95%B0%E5%88%A4%E6%96%AD/</loc>
    <lastmod>2018-01-31T17:31:50.369Z</lastmod>
    <data>
        <display>
        <title>LeetCode 9. Palindrome Number回文数判断</title>
        <pubTime>2017-12-10T06:06:46.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/31/LeetCode-11-Container-With-Most-Water/</loc>
    <lastmod>2018-01-31T17:31:21.065Z</lastmod>
    <data>
        <display>
        <title>LeetCode 11. Container With Most Water</title>
        <pubTime>2018-01-31T06:36:32.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-13-Roman-to-Integer%E5%92%8C12-Integer-to-Roman/</loc>
    <lastmod>2018-01-31T17:30:43.346Z</lastmod>
    <data>
        <display>
        <title>LeetCode 13. Roman to Integer和12. Integer to Roman</title>
        <pubTime>2017-12-10T06:07:49.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/10/LeetCode-14-Longest-Common-Prefix/</loc>
    <lastmod>2018-01-31T16:51:32.767Z</lastmod>
    <data>
        <display>
        <title>LeetCode 14.Longest Common Prefix</title>
        <pubTime>2017-12-10T06:08:45.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/31/LeetCode-16-3Sum-Closest/</loc>
    <lastmod>2018-01-31T16:50:05.958Z</lastmod>
    <data>
        <display>
        <title>LeetCode 16. 3Sum Closest</title>
        <pubTime>2018-01-31T08:34:16.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/31/LeetCode-15-3Sum/</loc>
    <lastmod>2018-01-31T16:47:52.301Z</lastmod>
    <data>
        <display>
        <title>LeetCode 15. 3Sum</title>
        <pubTime>2018-01-31T07:58:47.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/31/LeetCode-18-4Sum/</loc>
    <lastmod>2018-01-31T16:19:48.966Z</lastmod>
    <data>
        <display>
        <title>LeetCode 18. 4Sum</title>
        <pubTime>2018-01-31T08:50:36.000Z</pubTime>
        
        <tag>CPP</tag>
         
        <tag>LeetCode</tag>
         
         
           
             
              <breadCrumb title="算法" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/"/>
          
             
              <breadCrumb title="LeetCode" url="https://linjiafengyang.github.io/categories/%E7%AE%97%E6%B3%95/LeetCode/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/25/Python%E9%97%AE%E9%A2%98%E8%A7%A3%E5%86%B3%EF%BC%9AImportError-No-module-named-pygal-i18n/</loc>
    <lastmod>2018-01-31T15:10:14.256Z</lastmod>
    <data>
        <display>
        <title>Python问题解决：ImportError_ No module named 'pygal.i18n'</title>
        <pubTime>2018-01-25T07:23:33.000Z</pubTime>
        
        <tag>Python</tag>
         
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
  <url>
    <loc>https://linjiafengyang.github.io/2018/01/25/Python%E9%97%AE%E9%A2%98%E8%A7%A3%E5%86%B3%EF%BC%9AOSError-raw-write-returned-invalid-length-14-should-have-been-between-0-and-7/</loc>
    <lastmod>2018-01-31T15:10:01.848Z</lastmod>
    <data>
        <display>
        <title>Python问题解决：OSError_ raw write() returned invalid length 14 (should have been between 0 and 7)</title>
        <pubTime>2018-01-25T07:00:48.000Z</pubTime>
        
        <tag>Python</tag>
         
         
           
             
              <breadCrumb title="程序人生" url="https://linjiafengyang.github.io/categories/%E7%A8%8B%E5%BA%8F%E4%BA%BA%E7%94%9F/"/>
          
        </display>
    </data>
    </url>

    
    
    
  <url>
    <loc>https://linjiafengyang.github.io/2017/12/09/BeginFromZero/</loc>
    <lastmod>2017-12-09T12:27:09.399Z</lastmod>
    <data>
        <display>
        <title>BeginFromZero</title>
        <pubTime>2017-12-09T12:25:51.000Z</pubTime>
        
         
           
        </display>
    </data>
    </url>

</urlset>