<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chenhuihui_lora的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chenhuihui_lora</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chenhuihui_lora]]></copyright><item><title><![CDATA[go header大小写问题]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/102525206</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/102525206</guid><author>chenhuihui_lora</author><pubDate>Sat, 12 Oct 2019 18:06:29 +0800</pubDate><description><![CDATA[go会对Header中的key进行规范化处理，所以在获取response的Header中的K,V值时一定要小心。
reader.go中非导出方法canonicalMIMEHeaderKey中有这样一段，会将header的key进行规范化处理。
1）reader.go中定义了isTokenTable数组，如果key的长度大于127或者包含不在isTokenTable中的字符，则该key不会被处理。
...]]></description><category></category></item><item><title><![CDATA[26. 删除排序数组中的重复项]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/102487385</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/102487385</guid><author>chenhuihui_lora</author><pubDate>Thu, 10 Oct 2019 17:38:49 +0800</pubDate><description><![CDATA[func removeDuplicates(nums []int) int {
i := 0
for j:= 1;j&lt;len(nums);j++{
if nums[i]!=nums[j]{
i++
nums[i]=nums[j]
}
}
return i+1
}

]]></description><category></category></item><item><title><![CDATA[14.最长公共前缀]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/102483097</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/102483097</guid><author>chenhuihui_lora</author><pubDate>Thu, 10 Oct 2019 15:13:47 +0800</pubDate><description><![CDATA[func longestCommonPrefix(strs []string) string {
j := 0
if len(strs) == 1 {
return strs[0]
} else if len(strs) == 0 {
return “”
} else {
min := math.MaxInt32
for i := 0; i &lt;= len(strs)-1; i++ {
if ...]]></description><category></category></item><item><title><![CDATA[141.环形链表]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/102480534</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/102480534</guid><author>chenhuihui_lora</author><pubDate>Thu, 10 Oct 2019 13:46:23 +0800</pubDate><description><![CDATA[/**

Definition for singly-linked list.
type ListNode struct {

Val int



Next *ListNode


}
*/
func hasCycle(head *ListNode) bool {
hash := make(map[*ListNode]int)
for head !=nil{
if _,ok :=hash[hea...]]></description><category></category></item><item><title><![CDATA[curl 命令总结]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/101288856</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/101288856</guid><author>chenhuihui_lora</author><pubDate>Tue, 24 Sep 2019 15:46:38 +0800</pubDate><description><![CDATA[获取页面内容
当我们不加任何选项使用 curl 时，默认会发送 GET 请求来获取链接内容到标准输出。

curl http://0.0.0.0:8081
2. 显示 HTTP 头
如果我们只想要显示 HTTP 头，而不显示文件内容，可以使用 -I 选项：
curl -I http://0.0.0.0:8081
输出为：
HTTP/1.1 200 OK
Server: nginx/1.10.3
...]]></description><category></category></item><item><title><![CDATA[wsgi]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/101197199</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/101197199</guid><author>chenhuihui_lora</author><pubDate>Mon, 23 Sep 2019 10:55:21 +0800</pubDate><description><![CDATA[一个WSGI应⽤用不是一个Web服务器——它不在80端⼝口监听传入的请求等。相反，一个独⽴立的兼容 WSGI的Web服务器将扮演该角色，并把请求传递给WSGI应用。为了移交请求，Web服务器给您的应用程序提供了两个东⻄西： 一是请求环境（request environment），是一个类似字典的对象，它包含了 该请求所有用的信息（包括HTTP头，HTTP请求方法，客户端IP地址，路径和查询参数等）...]]></description><category></category></item><item><title><![CDATA[9. 回文数]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100750525</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100750525</guid><author>chenhuihui_lora</author><pubDate>Wed, 11 Sep 2019 21:50:21 +0800</pubDate><description><![CDATA[func isPalindrome(x int) bool {
y := 0
var xx  =x
for x!=0{
if x&lt;0{
return false
}
y = y*10 +x%10
x = x/10
}
return xx==y
}

]]></description><category></category></item><item><title><![CDATA[7. 整数反转]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100749194</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100749194</guid><author>chenhuihui_lora</author><pubDate>Wed, 11 Sep 2019 21:05:05 +0800</pubDate><description><![CDATA[func reverse(x int) int {
var restr string
if x &lt; 0 {
strin := strconv.Itoa(x)[1:]
fmt.Println(len(strin))
for i := len(strin) - 1; i &gt;=0; i-- {
restr += string(strin[i])
fmt.Println(restr)
}
re...]]></description><category></category></item><item><title><![CDATA[20. Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100742870</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100742870</guid><author>chenhuihui_lora</author><pubDate>Wed, 11 Sep 2019 17:27:49 +0800</pubDate><description><![CDATA[func isValid(s string) bool {
stack := make([]rune,0)
frontMap := map[rune]rune{’)’: ‘(’, ‘]’: ‘[’, ‘}’: ‘{’,}
for _, v := range s {
if v == ‘(’ || v == ‘{’ || v == ‘[’ {
stack = append(stack, v)
} el...]]></description><category></category></item><item><title><![CDATA[167. 两数之和 II - 输入有序数组]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100738971</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100738971</guid><author>chenhuihui_lora</author><pubDate>Wed, 11 Sep 2019 16:27:16 +0800</pubDate><description><![CDATA[func twoSum(numbers []int, target int) []int {
maps := make(map[int]int)
var arr []int
for i :=0;i&lt;len(numbers);i++{
tar := target-numbers[i]
index,ok := maps[tar]
if ok &amp;&amp; maps[tar]!=i{
if...]]></description><category></category></item><item><title><![CDATA[1. Two Sum]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100734851</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100734851</guid><author>chenhuihui_lora</author><pubDate>Wed, 11 Sep 2019 14:51:32 +0800</pubDate><description><![CDATA[1、时间复杂度：O(n^2)
对于每个元素，我们试图通过遍历数组的其余部分来寻找它所对应的目标元素，这将耗费 O(n)O(n) 的时间。因此时间复杂度为 O(n^2)
func twoSum(nums []int, target int) []int {
var arr []int
for i:=0;i&lt;len(nums)-1;i++{
for j:=i+1;j&lt;len(nums);j...]]></description><category></category></item><item><title><![CDATA[543. Diameter of Binary Tree  golang leetcode]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100731113</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100731113</guid><author>chenhuihui_lora</author><pubDate>Wed, 11 Sep 2019 11:27:55 +0800</pubDate><description><![CDATA[func max(a int,b int)int{
if a&gt;=b{
return a
}
return b
}
func maxall(a int,b int,c int)int{
return max(max(a,b),c)
}
func maxDepth1(root *TreeNode) int  {
if root==nil{
return 0
}
l := maxDepth1(ro...]]></description><category></category></item><item><title><![CDATA[web开发总结]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100729247</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100729247</guid><author>chenhuihui_lora</author><pubDate>Wed, 11 Sep 2019 10:36:06 +0800</pubDate><description><![CDATA[docker三个基本概念：
image：文件系统，提供容器运行所需要的程序，库，资源，配置，以及一些运行所需的配置参数，不包含动态数据
container：容器=镜像+读写层
repository：存放镜像文件的场所，
https://www.jianshu.com/p/5b73444eb47d
mysql
简答基础查询
flask获取入参  request ,reqparse
tyep = re...]]></description><category></category></item><item><title><![CDATA[二叉树]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100697380</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100697380</guid><author>chenhuihui_lora</author><pubDate>Tue, 10 Sep 2019 14:00:13 +0800</pubDate><description><![CDATA[比如上图正常的一个满节点，A：根节点、B：左节点、C：右节点，前序顺序是ABC（根节点排最先，然后同级先左后右）；中序顺序是BAC(先左后根最后右）；后序顺序是BCA（先左后右最后根）

...]]></description><category></category></item><item><title><![CDATA[169. 求众数]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100696823</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100696823</guid><author>chenhuihui_lora</author><pubDate>Tue, 10 Sep 2019 13:42:24 +0800</pubDate><description><![CDATA[/**

@Author: chenhuihui
@Date: 2019/9/9 20:38
*/
package main

import (
“fmt”
)
func findDisappearedNumbers(nums []int) int {
var pop []int
var cd int
arrLen := int(float64(len(nums)) / 2)
for i := 0...]]></description><category></category></item><item><title><![CDATA[leetcode 448. 找到所有数组中消失的数字]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100676390</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100676390</guid><author>chenhuihui_lora</author><pubDate>Mon, 09 Sep 2019 21:42:04 +0800</pubDate><description><![CDATA[func findDisappearedNumbers(nums []int) []int {
var cd []int
map1 := make(map[int]int)
for i := 1; i &lt;= len(nums); i++ {
map1[nums[i-1]] = i
}
for i := 1; i &lt;= len(nums); i++ {
if _, ok := map1[...]]></description><category></category></item><item><title><![CDATA[linux 快捷方式]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100580315</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100580315</guid><author>chenhuihui_lora</author><pubDate>Fri, 06 Sep 2019 15:56:25 +0800</pubDate><description><![CDATA[1、按v进入可视模式，移动光标选中需要复制的行；
2、使用y复制选中块到缓冲区（剪切选中块使用d）；
3、将光标移动到粘贴的位置，按p即可。
复制多行并粘贴到指定位置后，可能需要进行多行缩进。多行缩进步骤如下：
1、按shift+v进入可视模式，移动光标选中需要缩进的行；
2、使用&gt;向右缩进，使用&lt;向左缩进（注意使用符号&lt;和&gt;要按住shift，不然就变成了,和.）
复制并粘...]]></description><category></category></item><item><title><![CDATA[mysql对字符串进行数学运算]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100579979</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100579979</guid><author>chenhuihui_lora</author><pubDate>Fri, 06 Sep 2019 15:20:35 +0800</pubDate><description><![CDATA[在mysql当中,字符串类型间进行加减乘除运算的时候,会截取字符串以数字开头的那一部分数字进行运算,如果字符串前面没有数字,那么就只能截取的数值为0,那么进行加减的时候结果都是0,进行乘除的时候结果都是NULL,如下几个结果说明问题:
mysql&gt; select ‘1a’+‘1b’;
±----------+
| ‘1a’+‘1b’ |
±----------+
|         2 |
...]]></description><category></category></item><item><title><![CDATA[go 操作json]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100579623</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100579623</guid><author>chenhuihui_lora</author><pubDate>Fri, 06 Sep 2019 15:19:25 +0800</pubDate><description><![CDATA[package main
import (
“encoding/json”
“fmt”
//“os”
)
func main() {
jsonStr := {"accessToken":"507b5e08ee444dck887b66bd08672905", "clientToken":"64e3a5415bfe405d9485f1jf2ea5c68e", "selectedProfile":{"i...]]></description><category></category></item><item><title><![CDATA[消息中间件]]></title><link>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100576349</link><guid>https://blog.youkuaiyun.com/chenhuihui_lora/article/details/100576349</guid><author>chenhuihui_lora</author><pubDate>Fri, 06 Sep 2019 11:33:43 +0800</pubDate><description><![CDATA[帖子：https://blog.youkuaiyun.com/alinshen/article/details/80583214
MQ：redis，kfka
消息队列：解耦，异步，削峰。
缺点：可用性降低，复杂性升高

]]></description><category></category></item></channel></rss>