<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[我属码的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/code_me_now</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; code_me_now]]></copyright><item><title><![CDATA[Linux docker 启动Kibana失败：Data too large]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/122334023</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/122334023</guid><author>code_me_now</author><pubDate>Wed, 05 Jan 2022 23:02:52 +0800</pubDate><description><![CDATA[FATAL [circuit_breaking_exception] [parent] Data too large, data for [&lt;http_request&gt;] would be [250592200/246.0mb], which is larger than the limit of [246546432/235.1mb], real usage: [250592200/246.0mb], new bytes reserved: [0/0b], usages [requ...]]></description><category></category></item><item><title><![CDATA[SSH密钥连接Git仓库解决IDEA错误OpenSSL SSL_connect: Connection was reset in connection to github.com:443]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/118258172</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/118258172</guid><author>code_me_now</author><pubDate>Sun, 27 Jun 2021 02:13:22 +0800</pubDate><description><![CDATA[1. 先打开IDEA setting-&gt;Version Control-&gt;GitHub-&gt;勾选Clone git repository using ssh



2. 打开Git Bash，输入下边命令


ssh-keygen -t rsa -b 4096 -C "email_address@example.com"

3. 弹出下边命令，直接'回车‘就行, rsa文件会保存在C:\Users\Administrator\.ssh\id_rsa


Enter file in which]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No11[Easy]Middle of the Linked List 求链表的中间节点[快慢指针]]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/99647242</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/99647242</guid><author>code_me_now</author><pubDate>Wed, 21 Aug 2019 15:19:04 +0800</pubDate><description><![CDATA[Given a non-empty, singlylinked list with head nodehead, returnamiddle node of linked list.

If there are two middle nodes, return the second middle node.



Example 1:


Input: [1,2,3,4,5]
Outpu...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No10[Easy]: Unique Email Addresses 邮件地址的唯一性]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/98598194</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/98598194</guid><author>code_me_now</author><pubDate>Tue, 06 Aug 2019 13:17:18 +0800</pubDate><description><![CDATA[very email consists of a local name and a domain name, separated by the @ sign.

For example, inalice@leetcode.com,aliceis the local name, andleetcode.comis the domain name.

Besides lowercase le...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No9[Easy]: Search in a Binary Search Tree 查找二叉树中的值]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/98591340</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/98591340</guid><author>code_me_now</author><pubDate>Tue, 06 Aug 2019 10:28:19 +0800</pubDate><description><![CDATA[Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node's value equals the given value. Return the subtree rooted with that node. If such node...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No8[Easy]: Squares of a Sorted Array]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/98080617</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/98080617</guid><author>code_me_now</author><pubDate>Fri, 02 Aug 2019 11:53:30 +0800</pubDate><description><![CDATA[Given an array of integersAsorted in non-decreasing order,return an array of the squares of each number,also in sorted non-decreasing order.

Example 1:


Input: [-4,-1,0,3,10]
Output: [0,1,9,16,1...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No7[Medium]: Print Zero Even Odd 按顺序打印[010203...0n]]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/98060208</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/98060208</guid><author>code_me_now</author><pubDate>Thu, 01 Aug 2019 15:12:48 +0800</pubDate><description><![CDATA[第一次挑战Medium的题：

Suppose you are given the following code:


class ZeroEvenOdd {
 public ZeroEvenOdd(int n) { ... }     // constructor
  public void zero(printNumber) { ... }  // only output 0's
  pu...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No6[Easy]: Print in Order 按顺序执行线程]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/97793760</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/97793760</guid><author>code_me_now</author><pubDate>Wed, 31 Jul 2019 12:27:33 +0800</pubDate><description><![CDATA[Suppose we have a class:


public class Foo {
 public void first() { print("first"); }
 public void second() { print("second"); }
 public void third() { print("third"); }
}

The same instance ofFo...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No5[Easy]: Unique Morse Code Words 独一无二的摩斯密码]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/97248836</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/97248836</guid><author>code_me_now</author><pubDate>Thu, 25 Jul 2019 11:41:43 +0800</pubDate><description><![CDATA[International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows:"a"maps to".-","b"maps to"-...","c"maps to"-.-.", and so on.

For c...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No4[Easy]: Range Sum of BST 求二叉树某个区间内的数的和]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/96859147</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/96859147</guid><author>code_me_now</author><pubDate>Wed, 24 Jul 2019 16:54:23 +0800</pubDate><description><![CDATA[Given therootnode of a binary search tree, return the sum of values of all nodes with value betweenLandR(inclusive).

The binary search tree is guaranteed to have unique values.



Example 1:


...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No3[Easy]: Find Anagram Mappings 异构映射]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/96155957</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/96155957</guid><author>code_me_now</author><pubDate>Tue, 16 Jul 2019 17:41:14 +0800</pubDate><description><![CDATA[Given two listsA andB, andBis an anagram ofA.Bis an anagram ofAmeansBis made by randomizing theorder of the elements inA.

We want to find anindex mappingP, fromAtoB. A mappingP[i] =...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No2[Easy]: Jewels and Stones珠宝和石头]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/96106464</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/96106464</guid><author>code_me_now</author><pubDate>Tue, 16 Jul 2019 10:49:15 +0800</pubDate><description><![CDATA[You're given stringsJrepresenting the types of stones that are jewels, andSrepresenting the stones you have. Each character inSis a type of stone you have. You want to know how many of the sto...]]></description><category></category></item><item><title><![CDATA[LeetCode From Easy To Hard No1[Easy]: Two Sum]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/95627265</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/95627265</guid><author>code_me_now</author><pubDate>Fri, 12 Jul 2019 16:17:04 +0800</pubDate><description><![CDATA[Description:

Given an array of integers, returnindicesof the two numbers such that they add up to a specific target.

You may assume that each input would haveexactlyone solution, and you may no...]]></description><category></category></item><item><title><![CDATA[在 pycharm中使用matplotlib 出现Error “could not find or load the Qt platform plugin windows”]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/84839542</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/84839542</guid><author>code_me_now</author><pubDate>Wed, 05 Dec 2018 17:11:00 +0800</pubDate><description><![CDATA[使用matplotlib库绘图时出现以下错误：



解决方法：

在环境变量（Environment Variables）中增加一个变量QT_PLUGIN_PATH = C:\Adi\project\Anaconda3\Library\plugins(本机Anaconda3的安装路径)



添加完成后重启IDE(PyCharm)，再运行一次即可。



 ...]]></description><category></category></item><item><title><![CDATA[EasyUI Dialog关闭后，验证提示信息无法关闭且显示在页面最上端]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/80503113</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/80503113</guid><author>code_me_now</author><pubDate>Tue, 29 May 2018 22:23:33 +0800</pubDate><description><![CDATA[EasyUI Dialog关闭后，验证提示信息仍显示在页面最上端这算是EasyUI的一个bug吧？解决方法：在窗口关闭事件中，删除提示框（这貌似并不可行），只能将验证提示框隐藏起来。         $('#dialog').dialog({            onClose: function () {                    // 这种方法貌似并不可行            ...]]></description><category></category></item><item><title><![CDATA[Sublime Test3 3143简单入门]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/80189323</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/80189323</guid><author>code_me_now</author><pubDate>Sat, 05 May 2018 01:04:29 +0800</pubDate><description><![CDATA[1.下载地址：https://www.sublimetext.com/32.破解方法（针对3413版本）：    ①到这个目录C:\Windows\System32\drivers\etc下找到hosts文件，用文本编辑器打开，在末尾加入以下内容：    127.0.0.1 license.sublimehq.com    127.0.0.1 45.55.255.55    127.0.0.1 4...]]></description><category></category></item><item><title><![CDATA[Linux环境下搭建git远程仓库及远程连接git]]></title><link>https://blog.youkuaiyun.com/code_me_now/article/details/80094744</link><guid>https://blog.youkuaiyun.com/code_me_now/article/details/80094744</guid><author>code_me_now</author><pubDate>Thu, 26 Apr 2018 19:59:17 +0800</pubDate><description><![CDATA[这些天在公司的Linux服务器搭建了几人小团队用的git远程仓库，其实挺简单的，把一些亲测可用的记录下来；远程服务器：1.首先需要在服务器上初始化一个裸仓：  如在路劲下/opt/testgit/test.git/建个裸仓： git --bare init /opt/testgit/test.git/， 裸仓默认是属于当前用户的（我用的是root），想修改也可以，这里不做修改了，这样就新建了一个远...]]></description><category></category></item></channel></rss>