<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[tcm的博客]]></title><description><![CDATA[牛逼来自于苦逼；自律更自由]]></description><link>https://blog.youkuaiyun.com/Linux_Daemon</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Linux_Daemon]]></copyright><item><title><![CDATA[给老笔记本安装双系统，太难了（centos+win10）记录一下过程]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/140420221</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/140420221</guid><author>Linux_Daemon</author><pubDate>Sun, 14 Jul 2024 19:02:05 +0800</pubDate><description><![CDATA[安装双系统（win10+centos7）遇到的问题以及解决方法的记录]]></description><category></category></item><item><title><![CDATA[go web编程-Go 搭建一个web服务]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/127074676</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/127074676</guid><author>Linux_Daemon</author><pubDate>Wed, 28 Sep 2022 10:51:32 +0800</pubDate><description><![CDATA[【代码】go web编程-Go 搭建一个web服务。]]></description><category></category></item><item><title><![CDATA[go常用命令]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/111947976</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/111947976</guid><author>Linux_Daemon</author><pubDate>Wed, 30 Dec 2020 10:39:49 +0800</pubDate><description><![CDATA[// go 永久设置env中的config配置 
 //举个例子：
 go env -w GOPRIVATE=*gitlab.***.com



]]></description><category></category></item><item><title><![CDATA[windows git无法pull gitlab代码 （添加了ssh公钥）]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/111946746</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/111946746</guid><author>Linux_Daemon</author><pubDate>Wed, 30 Dec 2020 10:36:23 +0800</pubDate><description><![CDATA[首先 查看gitlab的端口是不是默认的22 ，一般不是
修改git 的默认端口

//1 找到ssh的目录
//2 在有公钥的那一层级创建名为config的文件,内容：
host gitlab.xxxx.com
port xxx
//3 设置ssh替换https
git config  --global url.ssh://git@gitlab.xxxxx.com.insteadof=https://gitlab.xxxxx.com


...]]></description><category></category></item><item><title><![CDATA[刷题-两数之和]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/106259479</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/106259479</guid><author>Linux_Daemon</author><pubDate>Thu, 21 May 2020 16:37:52 +0800</pubDate><description><![CDATA[func twoSum(nums []int, target int) []int {
    a := make(map[int]int)
    for i,v := range nums {
        if k,ok := a[target-v];ok {
            return []int{i, k}
        }
        a[v]=i
    }
    return nil
}

这个题，暴力直接搞定，for循环两次，便可以拿到结果，时间复杂度O(n2),可以.]]></description><category></category></item><item><title><![CDATA[6. Z 字形变换-力扣]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105849916</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105849916</guid><author>Linux_Daemon</author><pubDate>Wed, 29 Apr 2020 22:03:19 +0800</pubDate><description><![CDATA[将一个给定字符串根据给定的行数，以从上往下、从左到右进行 Z 字形排列。
L   C   I   R
E T O E S I I G
E   D   H   N
比如输入字符串为 “LEETCODEISHIRING” 行数为 3 时，排列如下：
之后，你的输出需要从左往右逐行读取，产生出一个新的字符串，比如：“LCIRETOESIIGEDHN”。
请你实现这个将字符串进行指定行数变换的函数：
s...]]></description><category></category></item><item><title><![CDATA[最长回文子串]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105760793</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105760793</guid><author>Linux_Daemon</author><pubDate>Sun, 26 Apr 2020 01:34:07 +0800</pubDate><description><![CDATA[最长回文子串

babad举例子





b
a
b
a
d




b
o
x
o
x
x


a
x
o
x
o
x


b
o
x
o
x
x


a
x
o
x
o
x


d
x
x
x
x
o


回文子串相当于二维数组，需要知道开始和结束位置，表中o代表是回文，横纵坐标分表代表开始和结束位置，其中有一边（开始大于结束忽略，对称的）
s 是字符串，长度用s(i,j)表示，i开始位置，...]]></description><category></category></item><item><title><![CDATA[割绳子]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105670513</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105670513</guid><author>Linux_Daemon</author><pubDate>Tue, 21 Apr 2020 23:06:06 +0800</pubDate><description><![CDATA[题目描述
给你一根长度为n的绳子，请把绳子剪成整数长的m段（m、n都是整数，n&gt;1并且m&gt;1），每段绳子的长度记为k[0],k[1],…,k[m]。请问k[0]xk[1]x…xk[m]可能的最大乘积是多少？例如，当绳子的长度是8时，我们把它剪成长度分别为2、3、3的三段，此时得到的最大乘积是18。
输入描述:	输入一个数n，意义见题面。（2 &lt;= n &lt;= 60）
输出描...]]></description><category></category></item><item><title><![CDATA[优美子数组]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105668441</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105668441</guid><author>Linux_Daemon</author><pubDate>Tue, 21 Apr 2020 21:36:57 +0800</pubDate><description><![CDATA[go版本

func numberOfSubarrays(nums []int, k int) int {
    arr := make([]int,0)
    flag ,res := 0, 0


    for i := 0; i &lt;len(nums); i++ {
        flag++

        if(nums[i] % 2 == 1){
          ...]]></description><category></category></item><item><title><![CDATA[php---归并排序]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105371776</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105371776</guid><author>Linux_Daemon</author><pubDate>Tue, 07 Apr 2020 19:29:00 +0800</pubDate><description><![CDATA[&lt;?php
// 归并排序主程序
function mergeSort($arr) {
    $len = count($arr);
    if ($len &lt;= 1) {
        return $arr;
    } // 递归结束条件, 到达这步的时候, 数组就只剩下一个元素了, 也就是分离了数组

    $mid = intval($len / 2); // 取数组...]]></description><category></category></item><item><title><![CDATA[php-希尔排序]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105290778</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105290778</guid><author>Linux_Daemon</author><pubDate>Fri, 03 Apr 2020 12:58:54 +0800</pubDate><description><![CDATA[&lt;?php
/*
希尔排序的实质就是分组插入排序，该方法又称缩小增量排序，因 DL．Shell于 1959 年提出而得名。
该方法的基本思想是：先将整个待排元素序列分割成若干个子序列（由相隔某个“增量”的元素组成的）分别进行直接插入排序，然后依次缩减增量再进行排序，待整个序列中的元素基本有序（增量足够小）时，再对全体元素进行一次直接插入排序。因为直接插入排序在元素基本有序的情况下（接近最好情...]]></description><category></category></item><item><title><![CDATA[php-直接插入排序]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105290244</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105290244</guid><author>Linux_Daemon</author><pubDate>Fri, 03 Apr 2020 12:16:30 +0800</pubDate><description><![CDATA[&lt;?php
/*
直接插入排序(Insertion Sort)的基本思想是：每次将一个待排序的记录，按其关键字大小插入到前面已经排好序的子序列中的适当位置，直到全部记录插入完成为止。
设数组为 a[0…n-1]。
1. 初始时，a[0]自成 1 个有序区，无序区为 a[1..n-1]。令 i=1
2. 将 a[i]并入当前的有序区 a[0…i-1]中形成 a[0…i]的有序区间。
3. i+...]]></description><category></category></item><item><title><![CDATA[php 正则获取字符串中某段未知子串]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105224112</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105224112</guid><author>Linux_Daemon</author><pubDate>Tue, 31 Mar 2020 15:39:48 +0800</pubDate><description><![CDATA[&lt;?php 

$i = '&lt;a target="_blank" title="3.29-3.31iPhone11领券立减200元，特惠机型推荐：XSMax低至5799元，XR低至4199元超值推荐！" href="//item.jd.com/100008348542.html" onclick="searchlog(1,100008348542,1,2,&gt;
&lt;a targ...]]></description><category></category></item><item><title><![CDATA[python正则获取字符串中某段不确定子串]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105223987</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105223987</guid><author>Linux_Daemon</author><pubDate>Tue, 31 Mar 2020 15:37:37 +0800</pubDate><description><![CDATA[import re

#1  todo 读文件替换 m 或者直接读网页
m = '&lt;a target="_blank" title="3.29-3.31iPhone11领券立减200元，特惠机型推荐：XSMax低至5799元，XR低至4199元超值推荐！" href="//item.jd.com/100008348542.html" onclick="searchlog(1,10000834...]]></description><category></category></item><item><title><![CDATA[py3.6 tk图片缩放]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105223863</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/105223863</guid><author>Linux_Daemon</author><pubDate>Tue, 31 Mar 2020 15:32:15 +0800</pubDate><description><![CDATA[import io  
#python -m pip install  pillow  （pillow是3版本之后的包PIL是2版本的）
from PIL import Image, ImageTk  
import tkinter as tk  
 
def resize(w, h, w_box, h_box, pil_image):  
  ''' 
  resize a pil_image...]]></description><category></category></item><item><title><![CDATA[n的阶乘末尾含0的个数]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/100745727</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/100745727</guid><author>Linux_Daemon</author><pubDate>Wed, 11 Sep 2019 19:05:31 +0800</pubDate><description><![CDATA[n的阶乘末尾含0的个数

设计一个算法，计算出n阶乘中尾部零的个数
样例
11! = 39916800，因此应该返回 2
挑战
O(logN)的时间复杂度

原理：ret=n/5 +  n/(5*5) + n/(5*5*5) + ⋯
but 没有搞明白
&lt;?php
//O(logN)
   function test1($n){
       $count = 0;
       $temp...]]></description><category></category></item><item><title><![CDATA[php排序-快排]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/100037649</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/100037649</guid><author>Linux_Daemon</author><pubDate>Fri, 23 Aug 2019 14:31:36 +0800</pubDate><description><![CDATA[&lt;?php

function quily(&amp;$arr, $l, $r)
{
    if ($l &lt; $r) {
        $i = $l;
        $j = $r;
        $x = $arr[$l];
        while ($i &lt; $j) {
            while (($i &lt; $j) &amp;&amp; ($x...]]></description><category></category></item><item><title><![CDATA[php 排序-冒泡]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/99776290</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/99776290</guid><author>Linux_Daemon</author><pubDate>Tue, 20 Aug 2019 00:02:38 +0800</pubDate><description><![CDATA[冒泡排序
找出最小的一个放在
&lt;?php

$a =[6,5,2,3,2,1];

// print_r($b);

for($i=0;$i&lt;count($a);$i++){
	for($j=$i+1;$j&lt;count($a);$j++){
		if($a[$j] &lt; $a[$i]){
			$k  = $a[$i];
			$a[$i] = $a[$j];
			$a[$...]]></description><category></category></item><item><title><![CDATA[php内核学习-基本变量zval 和zend_array 和zend_string]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/90548758</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/90548758</guid><author>Linux_Daemon</author><pubDate>Sun, 02 Jun 2019 21:09:47 +0800</pubDate><description><![CDATA[1.zval是php变量底层定义的结构，一共16字节

typedef struct _zval_struct     zval;
struct _zval_struct {   
           zend_value        value;     
           union u1;    
           union u2;
};



zval 的详细结构如下：
z...]]></description><category></category></item><item><title><![CDATA[sublime  安装扩展遇到的问题]]></title><link>https://blog.youkuaiyun.com/Linux_Daemon/article/details/90543993</link><guid>https://blog.youkuaiyun.com/Linux_Daemon/article/details/90543993</guid><author>Linux_Daemon</author><pubDate>Sat, 25 May 2019 10:45:35 +0800</pubDate><description><![CDATA[1 安装Package Control
import urllib.request,os; pf = 'Package Control.sublime-package'; ipp = sublime.installed_packages_path(); urllib.request.install_opener( urllib.request.build_opener( urllib.reques...]]></description><category></category></item></channel></rss>