<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DH_SIR的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/DH_SIR</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DH_SIR]]></copyright><item><title><![CDATA[leetcode130(被围绕的区域)-并查集]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106988931</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106988931</guid><author>DH_SIR</author><pubDate>Sat, 27 Jun 2020 22:14:15 +0800</pubDate><description><![CDATA[1.code
class Solution {
    class UnionFind{
        int[] parents;
        public UnionFind(int totalNodes){
            parents = new int[totalNodes];
            for(int i=0;i&lt;totalNodes;i++){
                parents[i]=i;
            }
        }
   ]]></description><category></category></item><item><title><![CDATA[leetcode 剑指 Offer 34]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106883634</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106883634</guid><author>DH_SIR</author><pubDate>Sun, 21 Jun 2020 11:46:32 +0800</pubDate><description><![CDATA[1.code
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    LinkedList&lt;Integer&gt; list = new LinkedList&lt;&g]]></description><category></category></item><item><title><![CDATA[leetcode 剑指 Offer 07]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106883429</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106883429</guid><author>DH_SIR</author><pubDate>Sun, 21 Jun 2020 11:30:38 +0800</pubDate><description><![CDATA[1.code
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] moredr;
    public Map&lt;Integer,Intege]]></description><category></category></item><item><title><![CDATA[leetcode113题解]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106753224</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106753224</guid><author>DH_SIR</author><pubDate>Sun, 14 Jun 2020 22:42:39 +0800</pubDate><description><![CDATA[1.code
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List&lt;List&lt;Integer&gt;&gt; allList = new ArrayLi]]></description><category></category></item><item><title><![CDATA[leetcode106题解]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106752337</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106752337</guid><author>DH_SIR</author><pubDate>Sun, 14 Jun 2020 21:45:58 +0800</pubDate><description><![CDATA[1.code
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] morder;
    public Map&lt;Integer,Intege]]></description><category></category></item><item><title><![CDATA[leetcode98题解]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106749382</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106749382</guid><author>DH_SIR</author><pubDate>Sun, 14 Jun 2020 18:07:03 +0800</pubDate><description><![CDATA[1.code
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isValidBSTHelp(TreeNode root, Integer ]]></description><category></category></item><item><title><![CDATA[leetcode894题解记录]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106606718</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106606718</guid><author>DH_SIR</author><pubDate>Sun, 07 Jun 2020 20:25:55 +0800</pubDate><description><![CDATA[1.code
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    Map&lt;Integer,List&lt;TreeNode&gt;&gt; map = new Has]]></description><category></category></item><item><title><![CDATA[leetcode794题解]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106606329</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106606329</guid><author>DH_SIR</author><pubDate>Sun, 07 Jun 2020 19:57:54 +0800</pubDate><description><![CDATA[1.code
class Solution {
    public boolean check(String[]board,char c){
        for(int i=0;i&lt;3;i++){
            if(board[0].toCharArray()[i]==c&amp;&amp;board[1].toCharArray()[i]==c&amp;&amp;board[2].toCharArray()[i]==c){
                return true;
]]></description><category></category></item><item><title><![CDATA[leetcode779题解记录]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106599748</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106599748</guid><author>DH_SIR</author><pubDate>Sun, 07 Jun 2020 12:02:59 +0800</pubDate><description><![CDATA[1.code
class Solution {
    public int kthGrammar(int N, int K) {
        if(N==1)return 0;
        return (~K &amp; 1)^kthGrammar(N-1,(K+1)/2);
    }
}

2.题解分析
第一行  0
第二行 01
第三行 0110
第四行 01101001
可以总结规律，某一行的第 K 个数字是上一行第 (K+1) / 2 个数字生成的。如果上一行的数字为 0，被生成的数字]]></description><category></category></item><item><title><![CDATA[【leetcode】43题代码记录]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106459738</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106459738</guid><author>DH_SIR</author><pubDate>Sun, 31 May 2020 19:19:13 +0800</pubDate><description><![CDATA[1.代码记录


class Solution {
    public String multiply(String num1, String num2) {
        if("0".equals(num1)||"0".equals(num2))return "0";
        char[] num1Ch = num1.toCharArray();
        char[] num2Ch = num2.toCharArray();
        String res = "0";
  .]]></description><category></category></item><item><title><![CDATA[【leetcode】415题代码记录]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/106459374</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/106459374</guid><author>DH_SIR</author><pubDate>Sun, 31 May 2020 19:06:32 +0800</pubDate><description><![CDATA[1.通过代码


class Solution {
    public String addStrings(String num1, String num2) {
        StringBuilder bu = new StringBuilder();
        char[] num1Ch = num1.toCharArray();
        char[] num2Ch = num2.toCharArray();
        int up = 0;
        for(int i]]></description><category></category></item><item><title><![CDATA[SQL中IFNULL关键字的用法]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/102598520</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/102598520</guid><author>DH_SIR</author><pubDate>Thu, 17 Oct 2019 08:49:02 +0800</pubDate><description><![CDATA[MYSQL IFNULL(ex1,ex2)
如果ex1不是NULL，IFNULL()返回ex1，否则它返回ex2。

]]></description><category></category></item><item><title><![CDATA[scala中的跨行字符串]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/102001275</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/102001275</guid><author>DH_SIR</author><pubDate>Thu, 03 Oct 2019 16:37:35 +0800</pubDate><description><![CDATA[1.不带处理方式
在scala中可以用"""的方式创建多行字符串
object HelloString{
  def main(args: Array[String]): Unit = {
     val str ="""hello scala
                 hello String
                 hello world"""
     println(s...]]></description><category></category></item><item><title><![CDATA[python3实现爬虫，爬取移动端微博搜索的个股的财经博主相关的微博的文本、评论以及转发等信息。]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/80743454</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/80743454</guid><author>DH_SIR</author><pubDate>Wed, 20 Jun 2018 11:09:57 +0800</pubDate><description><![CDATA[1.环境须知 
做这个爬取的时候需要安装好python3.6、requests、re以及xlwt模块。request主要是用于爬取页面信息，xlwt主要用于excel的交互，将爬取数据保存至excel，如果需要将数据保存至MongoDB，则需要添加与MongoDB数据库交互的模块。 
2.直接上代码 
spider.py



import json
import re
import reques...]]></description><category></category></item><item><title><![CDATA[centos防火墙开启、关闭、查看状态。]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/79244059</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/79244059</guid><author>DH_SIR</author><pubDate>Fri, 02 Feb 2018 23:16:09 +0800</pubDate><description><![CDATA[一、.对于centos7自带的防火墙的相关指令 
systemctl stop firewalld.service #停止firewall 
systemctl disable firewalld.service #禁止firewall开机启动 
systemctl status firewalld.service #查看firewall的状态

二、iptables防火墙的相关状态 
关闭虚拟机...]]></description><category></category></item><item><title><![CDATA[centos7.0安装mysql5.7]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/79051657</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/79051657</guid><author>DH_SIR</author><pubDate>Sat, 13 Jan 2018 15:23:06 +0800</pubDate><description><![CDATA[1.环境准备 
安装好centos7.0或其他版本的系统。 
卸载centos自带的mariadb。CentOS 7已经将默认集成mariadb而不是mysql，这对于多数还是依赖于mysql的应用来说，需要手动的进行更新。 
首先查看都安装了哪些的mariadb相关的模块。

rpm -qa | grep mariadb

然后进行卸载。

rpm -e mariadb-libs-5.5.44-]]></description><category></category></item><item><title><![CDATA[基于CentOS7.0环境编译Spark-2.2.1源码]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/79011723</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/79011723</guid><author>DH_SIR</author><pubDate>Tue, 09 Jan 2018 13:01:26 +0800</pubDate><description><![CDATA[1.环境准备 
需要提前安装的系统和软件： 
系统： 
centos7.0 
软件： 
spark-2.2.1.tgz源码 
jdk-8u144-linux-x64.tar.gz   JDK1.8以上 
apache-maven-3.3.9-bin.tar.gz 
scala-2.11.8.tgz 
hadoop-2.6.0-cdh5.7.0.tar.gz 
linux下面创建目录的习惯： 
ap]]></description><category></category></item><item><title><![CDATA[大数据开发工程师的一个解说图]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/78803410</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/78803410</guid><author>DH_SIR</author><pubDate>Thu, 14 Dec 2017 15:43:34 +0800</pubDate><description><![CDATA[想成为大数据开发工程师的朋友可以参考看看学些啥。]]></description><category></category></item><item><title><![CDATA[第一个flag]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/78637322</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/78637322</guid><author>DH_SIR</author><pubDate>Sun, 26 Nov 2017 14:47:55 +0800</pubDate><description><![CDATA[在csdn立一个flag：大四之前学好java和linux。]]></description><category></category></item><item><title><![CDATA[window下面安装scrapy爬虫框架（python3.6+scrapy）]]></title><link>https://blog.youkuaiyun.com/DH_SIR/article/details/78522960</link><guid>https://blog.youkuaiyun.com/DH_SIR/article/details/78522960</guid><author>DH_SIR</author><pubDate>Mon, 13 Nov 2017 17:56:55 +0800</pubDate><description><![CDATA[1.安装文件的准备 
传送门2.具体的安装步骤 
1）在命令行模式下面安装wheelpip install wheel2）在命令行模式下面安装lxml（下面whl文件的路径根据你的文件的路径具体些，我的就在当前的路径下面）pip install lxml-4.1.1-cp36-cp36m-win_amd64.whl3）在命令行模式下面安装PyOpensslpip install pyOpenSSL-]]></description><category></category></item></channel></rss>