<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LeeWei]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/liwei1205</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; liwei1205]]></copyright><item><title><![CDATA[Netty入门实战]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/107282665</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/107282665</guid><author>liwei1205</author><pubDate>Sat, 11 Jul 2020 11:59:16 +0800</pubDate><description><![CDATA[Netty入门实战


新建工程



添加maven依赖
https://mvnrepository.com
&lt;!-- https://mvnrepository.com/artifact/io.netty/netty-all --&gt;
&lt;dependency&gt;
    &lt;groupId&gt;io.netty&lt;/groupId&gt;
    &lt;artifactId&gt;netty-all&lt;/artifactId&gt;
    &lt;version&g]]></description><category></category></item><item><title><![CDATA[sparkStreaming接收kafka消息，写入数据库]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/106590250</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/106590250</guid><author>liwei1205</author><pubDate>Sat, 06 Jun 2020 16:57:44 +0800</pubDate><description><![CDATA[sparkStreaming接收kafka消息，写入数据库
package com.ruijie.spark.stream

import org.apache.kafka.clients.consumer.ConsumerConfig
import org.apache.spark.streaming.{Seconds, StreamingContext}
import org.apache.spark.{SparkConf, SparkContext}
import org.apache.kafka.c]]></description><category></category></item><item><title><![CDATA[Docker内如何使用crontab]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/106368130</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/106368130</guid><author>liwei1205</author><pubDate>Tue, 26 May 2020 23:41:48 +0800</pubDate><description><![CDATA[Docker内如何使用crontab


run.sh
#!/bin/bash
timestamp=`date +%Y/%m/%d-%H:%M:%S`
echo "System path is $PATH at $timestamp"



entrypoint.sh


#!/bin/bash

# Start the run once job.
echo "Docker container has been started"

declare -p | grep -Ev 'BASHOPTS|BASH_V]]></description><category></category></item><item><title><![CDATA[standalone模式下的资源、任务调度源码剖析]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/105309487</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/105309487</guid><author>liwei1205</author><pubDate>Sat, 04 Apr 2020 14:06:58 +0800</pubDate><description><![CDATA[standalone模式下的资源、任务调度源码剖析
整体流程图

standalone模式简介
standalone模式，是spark自带的资源调度框架，该框架下主要有三个节点：

client  客户端，将应用程序提交，记录着要运行业务逻辑
master 负责资源管理
worker 负责任务的执行

spark Application有个Driver驱动，即用户提交的程序，Driver进程可以运...]]></description><category></category></item><item><title><![CDATA[Intellij IDEA2017.3.5安装]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/103727162</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/103727162</guid><author>liwei1205</author><pubDate>Sun, 29 Dec 2019 18:52:44 +0800</pubDate><description><![CDATA[1.下载安装包及

链接: https://pan.baidu.com/s/16az6tmQub-bOn2CFOXLa2g 提取码: 7689 复制这段内容后打开百度网盘手机App，操作更方便哦

2.将下载的JetbrainsCrack-2.7-release-str.jar补丁放在idea的安装目录下的bin目录下



3.修改该bin目录下的两个文件:idea.exe.vmoptio...]]></description><category></category></item><item><title><![CDATA[python时间与时区]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/102889482</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/102889482</guid><author>liwei1205</author><pubDate>Mon, 04 Nov 2019 00:32:31 +0800</pubDate><description><![CDATA[pandas中的时区
默认情况下，pandas中的时间序列是单纯的（naive）时区
import pandas as pd
import numpy as np
rng = pd.date_range('3/9/2012 9:30', periods=6, freq='D')
ts = pd.Series(np.random.randn(len(rng)), index=rng)

print(...]]></description><category></category></item><item><title><![CDATA[Docker笔记]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/102485645</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/102485645</guid><author>liwei1205</author><pubDate>Thu, 10 Oct 2019 16:53:20 +0800</pubDate><description><![CDATA[根据镜像运行一个容器
docker run -it ubuntu:16.04 /bin/bash


列出镜像

docker images



进入docker容器

docker attach
docker exec -it goofy_almeida /bin/bash



退出容器

exit
Ctrl + D



列出最近的容器

docker ps -n 3



过滤容器
...]]></description><category></category></item><item><title><![CDATA[Python读取mongodb采坑记录]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/101471328</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/101471328</guid><author>liwei1205</author><pubDate>Thu, 26 Sep 2019 20:22:49 +0800</pubDate><description><![CDATA[pymongo在读写dataframe时自动的相差8个小时


dataframe数据集预览



查看一下数据的类型



可以看到，collect_time的数据类型是datetime64


写入mongodb
connections.insert(json.loads(data_final.T.to_json()).values())



查看数据库

通过对比我们发现，当将 datet...]]></description><category></category></item><item><title><![CDATA[python模块导入报错 ImportError: No module named 'xxx']]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/101104907</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/101104907</guid><author>liwei1205</author><pubDate>Sat, 21 Sep 2019 13:30:45 +0800</pubDate><description><![CDATA[python模块以及导入出现ImportError: No module named 'xxx’问题
python中，每个py文件被称之为模块，每个具有__init__.py文件的目录被称为包。只要模 块或者包所在的目录在sys.path中，就可以使用import 模块或import 包来使用
若需要导入不同目录的文件，首先使用sys.path.append方法将所需目录加入到搜素目录中。然后进行...]]></description><category></category></item><item><title><![CDATA[数据结构与算法]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/100810441</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/100810441</guid><author>liwei1205</author><pubDate>Fri, 13 Sep 2019 20:38:20 +0800</pubDate><description><![CDATA[转圈打印矩阵
	“之”字形打印矩阵
	数组中是否出现长度大于一半的数：依次删除两个不同的数
	1-m的随机数，产生1-n的随机数
	无序数组，需要排序的最短长度
	找到局部最小
	返回子数组乘积最大的值
	完全二叉树的节点数
	两个长度相同的有序数组，求上中位数
	两个排序数组中第k小的数
	Manacher算法
	kmp算法
	BFPRT算法：无序数组中找到第k小的数
	一个无序数组，知道没有出...]]></description><category></category></item><item><title><![CDATA[ubuntu搭建spark单机版]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/99481091</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/99481091</guid><author>liwei1205</author><pubDate>Tue, 13 Aug 2019 21:51:33 +0800</pubDate><description><![CDATA[安装Java SE


1、下载JAVA SE linux版本。下载地址为：
http://www.oracle.com/technetwork/java/javase/downloads/jdk8-downloads-2133151.html

注意选择Linux版本，根据机器类型选择32位或者64位。

2、下载jdk-8u131-linux-x64.tar.gz后，解压到自己指定目录。

...]]></description><category></category></item><item><title><![CDATA[Tensorflow笔记（一）]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/99327980</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/99327980</guid><author>liwei1205</author><pubDate>Mon, 12 Aug 2019 19:33:30 +0800</pubDate><description><![CDATA[Tensorflow笔记



tf_cnn_benchmarks运行命令


 tf_cnn_benchmarks
​
--device=cpu --data_format=NHWC works for me.
I would suggest that --device=cpu --data_format=NHWC...]]></description><category></category></item><item><title><![CDATA[LeetCode力扣之135. Candy]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/79708896</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/79708896</guid><author>liwei1205</author><pubDate>Tue, 27 Mar 2018 10:17:07 +0800</pubDate><description><![CDATA[There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least one candy....]]></description><category></category></item><item><title><![CDATA[133. Clone Graph]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/79705438</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/79705438</guid><author>liwei1205</author><pubDate>Mon, 26 Mar 2018 22:21:22 +0800</pubDate><description><![CDATA[Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each node, and...]]></description><category></category></item><item><title><![CDATA[LeetCode力扣之132. Palindrome Partitioning II]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/79704323</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/79704323</guid><author>liwei1205</author><pubDate>Mon, 26 Mar 2018 21:13:37 +0800</pubDate><description><![CDATA[Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s = &quot;aab&quot;,Return 1 since t...]]></description><category></category></item><item><title><![CDATA[LeetCode力扣之131. Palindrome Partitioning]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/79703391</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/79703391</guid><author>liwei1205</author><pubDate>Mon, 26 Mar 2018 20:17:13 +0800</pubDate><description><![CDATA[Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = &quot;aab&quot;,Return[
  [&quot;aa&quot;,&quot;b&quot;],
  [&quot;a&quot;,&quot;a&quot;,...]]></description><category></category></item><item><title><![CDATA[LeetCode力扣之130. Surrounded Regions]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/79701134</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/79701134</guid><author>liwei1205</author><pubDate>Mon, 26 Mar 2018 17:28:48 +0800</pubDate><description><![CDATA[Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example,X X X X
X O O X
...]]></description><category></category></item><item><title><![CDATA[LeetCode力扣之129. Sum Root to Leaf Numbers]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/79697414</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/79697414</guid><author>liwei1205</author><pubDate>Mon, 26 Mar 2018 14:10:48 +0800</pubDate><description><![CDATA[Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1-&amp;gt;2-&amp;gt;3 which represents the number 123.Find the total su...]]></description><category></category></item><item><title><![CDATA[LeetCode力扣之128. Longest Consecutive Sequence]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/79697013</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/79697013</guid><author>liwei1205</author><pubDate>Mon, 26 Mar 2018 13:39:55 +0800</pubDate><description><![CDATA[Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3, 4]. Re...]]></description><category></category></item><item><title><![CDATA[LeetCode力扣之126. Word Ladder II]]></title><link>https://blog.youkuaiyun.com/liwei1205/article/details/79695012</link><guid>https://blog.youkuaiyun.com/liwei1205/article/details/79695012</guid><author>liwei1205</author><pubDate>Mon, 26 Mar 2018 10:51:26 +0800</pubDate><description><![CDATA[Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:Only one letter can be changed at a timeEach tr...]]></description><category></category></item></channel></rss>