<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[勿问情殇的博客]]></title><description><![CDATA[记录工作日常，及难点，重点]]></description><link>https://blog.youkuaiyun.com/chen158_7</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chen158_7]]></copyright><item><title><![CDATA[Mac电脑常用命令集]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/94736000</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/94736000</guid><author>chen158_7</author><pubDate>Wed, 03 Jun 2020 11:53:44 +0800</pubDate><description><![CDATA[node 管理工具 n:

sduo npm install -g n    安装 node 管理工具
n &lt;node_version_number&gt; 安装指定版本的node
n latest  安装 node 最新版本
n stable  安装 node 未定版本
n rm &lt;node_version_number&gt; 删除某个 node 版本
n use &lt;node...]]></description><category></category></item><item><title><![CDATA[JavaScript 实用知识点总结]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/92669696</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/92669696</guid><author>chen158_7</author><pubDate>Tue, 18 Jun 2019 11:08:25 +0800</pubDate><description><![CDATA[1.链接文本 -&gt; 可点击的超链接
var text = "我是链接文本https://www.baidu.com"
var re = /(http(s)?:\/\/[\w.\/]+)(?![^&lt;]+&gt;)/gi;
text = text.replace(re, "&lt;a target='_blank' href='$1'&gt;$1&lt;/a&gt;");

2.禁止页面滚...]]></description><category></category></item><item><title><![CDATA[vim 常用操作]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/87347171</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/87347171</guid><author>chen158_7</author><pubDate>Fri, 15 Feb 2019 10:55:10 +0800</pubDate><description><![CDATA[vim 常用操作:

普通模式下编辑文本常用命令：

yy 复制一行
p  粘贴
dd 删除一行
u 撤销
ctrl + r 恢复
x 删除光标所在位置的字符
:/xxx 查找字符串，xxx 为目标字符串, 按下 Enter 键找到 匹配字符之后，输入字符n移到下一个匹配字符，输入字符N移到上一个匹配字符。
:n  跳到某一行， n 为要跳转的行号 ，按下Enter键执行命令
nG 跳到某一行， ...]]></description><category></category></item><item><title><![CDATA[29. 两数相除]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648367</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648367</guid><author>chen158_7</author><pubDate>Sun, 27 Jan 2019 13:04:24 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def divide(self, dividend, divisor):
        &amp;quot;&amp;quot;&amp;quot;
        :type dividend: int
        :type divisor: int
        :rtype: int
        &amp;quot;&amp;quot;&amp;quot;
   ..]]></description><category></category></item><item><title><![CDATA[28. 实现strStr()]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648345</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648345</guid><author>chen158_7</author><pubDate>Sun, 27 Jan 2019 13:04:17 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def strStr(self, haystack, needle):
        &amp;quot;&amp;quot;&amp;quot;
        :type haystack: str
        :type needle: str
        :rtype: int
        &amp;quot;&amp;quot;&amp;quot;
     ..]]></description><category></category></item><item><title><![CDATA[27. 移除元素]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648324</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648324</guid><author>chen158_7</author><pubDate>Sun, 27 Jan 2019 13:04:05 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def removeElement(self, nums, val):
        &amp;quot;&amp;quot;&amp;quot;
        :type nums: List[int]
        :type val: int
        :rtype: int
        &amp;quot;&amp;quot;&amp;quot;
      ..]]></description><category></category></item><item><title><![CDATA[26. 删除排序数组中的重复项]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648295</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648295</guid><author>chen158_7</author><pubDate>Sun, 27 Jan 2019 13:03:55 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def removeDuplicates(self, nums):
        &amp;quot;&amp;quot;&amp;quot;
        :type nums: List[int]
        :rtype: int
        &amp;quot;&amp;quot;&amp;quot;
        i = 0
        for j in ..]]></description><category></category></item><item><title><![CDATA[25. k个一组翻转链表]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648260</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648260</guid><author>chen158_7</author><pubDate>Sun, 27 Jan 2019 13:03:48 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def ...]]></description><category></category></item><item><title><![CDATA[24. 两两交换链表中的节点]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648234</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648234</guid><author>chen158_7</author><pubDate>Sun, 27 Jan 2019 13:03:39 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def ...]]></description><category></category></item><item><title><![CDATA[23. 合并K个排序链表]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648194</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648194</guid><author>chen158_7</author><pubDate>Sun, 27 Jan 2019 13:03:30 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
import functools

class S...]]></description><category></category></item><item><title><![CDATA[21. 合并两个有序链表]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648063</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648063</guid><author>chen158_7</author><pubDate>Sun, 27 Jan 2019 13:02:59 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
import functools
class So...]]></description><category></category></item><item><title><![CDATA[20. 有效的括号]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86648015</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86648015</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:19:16 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def isValid(self, s):
        &quot;&quot;&quot;
        :type s: str
        :rtype: bool
        &quot;&quot;&quot;
        &quot;&quot;&quot;
        有效的字符串的: (){}[] 、 ({[]})
      ...]]></description><category></category></item><item><title><![CDATA[19. 删除链表的倒数第N个节点]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86647980</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86647980</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:17:36 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def ...]]></description><category></category></item><item><title><![CDATA[18. 四数之和]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86647936</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86647936</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:16:06 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def fourSum(self, nums, target):
        &quot;&quot;&quot;
        :type nums: List[int]
        :type target: int
        :rtype: List[List[int]]
      ...]]></description><category></category></item><item><title><![CDATA[17. 电话号码的字母组合]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86647919</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86647919</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:14:46 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
import re
class Solution:
    def cc(self,a,b):
        if len(a) &amp;lt; len(b):
            d = a
            a = b
            b = d
        c = []
        if ...]]></description><category></category></item><item><title><![CDATA[16. 最接近的三数之和]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86647878</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86647878</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:12:53 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
import sys
class Solution:
    def threeSumClosest(self, nums, target):
        &quot;&quot;&quot;
        :type nums: List[int]
        :type target: int
        :rtype: int...]]></description><category></category></item><item><title><![CDATA[15. 三数之和]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86647808</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86647808</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:09:44 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def threeSum(self, nums):
        &quot;&quot;&quot;
        :type nums: List[int]
        :rtype: List[List[int]]
        &quot;&quot;&quot;
        &quot;&quot;&quot;
        思路：先将数组...]]></description><category></category></item><item><title><![CDATA[14. 最长公共前缀]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86647761</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86647761</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:07:42 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def longestCommonPrefix(self, strs):
        &quot;&quot;&quot;
        :type strs: List[str]
        :rtype: str
        &quot;&quot;&quot;
        &quot;&quot;&quot;
        思路: 假定第一...]]></description><category></category></item><item><title><![CDATA[13. 罗马数字转整数]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86647716</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86647716</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:05:31 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def romanToInt(self, s):
        &quot;&quot;&quot;
        :type s: str
        :rtype: int
        &quot;&quot;&quot;
        &quot;&quot;&quot;
        思路：罗马数字的字符对应的数值，基本上都是前一个比后一个大...]]></description><category></category></item><item><title><![CDATA[12. 整数转罗马数字]]></title><link>https://blog.youkuaiyun.com/chen158_7/article/details/86647680</link><guid>https://blog.youkuaiyun.com/chen158_7/article/details/86647680</guid><author>chen158_7</author><pubDate>Fri, 25 Jan 2019 16:03:42 +0800</pubDate><description><![CDATA[
题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:
class Solution:
    def intToRoman(self, num):
        &quot;&quot;&quot;
        :type num: int
        :rtype: str
        &quot;&quot;&quot;
        &quot;&quot;&quot;
        思路：提取数字的各个位数，并加以判断，需要注意的是...]]></description><category></category></item></channel></rss>