<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[shaobing_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/shaobing_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; shaobing_]]></copyright><item><title><![CDATA[DataX(一)：编译运行]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/130836519</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/130836519</guid><author>shaobing_</author><pubDate>Wed, 24 May 2023 01:42:19 +0800</pubDate><description><![CDATA[运行：/opt/homebrew/bin/python3 datax.py stream.json。配置文件core/target/datax/bin/stream.json文件。注意datax.py目录在core目录下，这里以stream进行测试。本人开发环境Macbook M1，一切顺利～接下来可以愉快的进行Debug啦。]]></description><category></category></item><item><title><![CDATA[两年经验面试记录]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/130757670</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/130757670</guid><author>shaobing_</author><pubDate>Fri, 19 May 2023 00:10:37 +0800</pubDate><description><![CDATA[工作两年，重新准备面试，目标回长沙。]]></description><category></category></item><item><title><![CDATA[[Spring项目部署]spring项目简单部署]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/127484258</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/127484258</guid><author>shaobing_</author><pubDate>Mon, 24 Oct 2022 01:41:03 +0800</pubDate><description><![CDATA[springboot项目部署]]></description><category></category></item><item><title><![CDATA[【Leetcode-python】栈和队列题II]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/85147901</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/85147901</guid><author>shaobing_</author><pubDate>Thu, 20 Dec 2018 23:37:15 +0800</pubDate><description><![CDATA[


class MyStack(object):
    &quot;&quot;&quot;
    双向列表实现，为什么push时候使用q更快？此方法36ms，注释方法20ms
    &quot;&quot;&quot;
    def __init__(self):
        self._queue = collections.deque()

    def push(self, x):
        # q = self._queue...]]></description><category></category></item><item><title><![CDATA[【Leetcode-python】栈和队列题I]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/85108129</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/85108129</guid><author>shaobing_</author><pubDate>Wed, 19 Dec 2018 20:54:23 +0800</pubDate><description><![CDATA[


class Solution(object):
    &quot;&quot;&quot;
    定义一个栈和一个字典
    如果进入左括号则append
    如果进入右括号则查看栈顶是否为空，非空与栈顶元素比较，两者匹配则继续，不匹配则返回错误
    &quot;&quot;&quot;
    def isValid(self,s):
        stack = []
        map = {')':'(',']':'[',...]]></description><category></category></item><item><title><![CDATA[【Leetcode】链表题III【python】]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/85084820</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/85084820</guid><author>shaobing_</author><pubDate>Tue, 18 Dec 2018 23:25:59 +0800</pubDate><description><![CDATA[


class Solution(object):
    def hasCycle(self, head):
        &quot;&quot;&quot;
        :type head: ListNode
        :rtype: bool
        法一：设置一个快指针，一个慢指针
        如果有环则必有fast==slow
        &quot;&quot;&quot;
        slow=fast=...]]></description><category></category></item><item><title><![CDATA[【Leetcode】链表题II【python】]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/85079060</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/85079060</guid><author>shaobing_</author><pubDate>Tue, 18 Dec 2018 20:54:02 +0800</pubDate><description><![CDATA[
class Solution(object):
    &quot;&quot;&quot;
    存留头节点的问题return new = head?？
    此处返回self.next
    保证链表不断，记录下前节点pre，然后交换当前节点和下一个节点
    &quot;&quot;&quot;
    def swapPairs(self, head):
        &quot;&quot;&quot;
        :type head: ListNode
 ...]]></description><category></category></item><item><title><![CDATA[【Leetcode】链表题I【python】]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/84898488</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/84898488</guid><author>shaobing_</author><pubDate>Sat, 08 Dec 2018 20:18:35 +0800</pubDate><description><![CDATA[


class Solution:
    &quot;&quot;&quot;
    递归思路：不断递归下一个节点
    最后两个节点开始反转
    递归中止条件：当前节点不存在下一个节点
    &quot;&quot;&quot;
    def reverseList(self, head):
        if not head or not head.next:
            return head
        p = ...]]></description><category></category></item><item><title><![CDATA[【LeetCode】数组题目III【Python】]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/84891901</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/84891901</guid><author>shaobing_</author><pubDate>Sat, 08 Dec 2018 14:52:40 +0800</pubDate><description><![CDATA[


class Solution(object):
    &quot;&quot;&quot;类似3sum，固定头尾，进行循环，应该有更优方法，但是通过勒，代码也很好理解&quot;&quot;&quot;
    &quot;&quot;&quot;去重代码此处先判断是否存在此列表，在进行添加。另一种跳过重复，不能简单使用两个while&quot;&quot;&quot;
    def fourSum(self, nums, target):
        ans=[]
        nums.]]></description><category></category></item><item><title><![CDATA[【Leetcode】数组题目【Python】]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/84038090</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/84038090</guid><author>shaobing_</author><pubDate>Tue, 13 Nov 2018 23:03:59 +0800</pubDate><description><![CDATA[


class Solution(object):
    def twoSum(self, nums, target):
        &quot;&quot;&quot;
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        &quot;&quot;&quot;
        dic={}  #dict = dict()
...]]></description><category></category></item><item><title><![CDATA[【牛客网】数组题目I---【Python】]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/84032138</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/84032138</guid><author>shaobing_</author><pubDate>Tue, 13 Nov 2018 18:51:53 +0800</pubDate><description><![CDATA[


class Solution:
    # array 二维列表
    def Find1(self, target, array):
        # write code here
        for i in range(len(array)):
            for j in range(len(array[0])):
                if arra...]]></description><category></category></item><item><title><![CDATA[【leetcode】---数组题目【python】]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/83929358</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/83929358</guid><author>shaobing_</author><pubDate>Sat, 10 Nov 2018 14:35:22 +0800</pubDate><description><![CDATA[26.Remove duplicate from Sorted Array



思路：题目不允许开辟新空间，且数组排好序。若nums[i]==nums[index-1]，增加i去避免复制。当nums[i]!=nums[index-1]，此时进行复制，且让index+1，重复操作直至i达到len（nums）


class Solution:
    def removeDuplicates(se...]]></description><category></category></item><item><title><![CDATA[朴素贝叶斯代码讲解]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/83833856</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/83833856</guid><author>shaobing_</author><pubDate>Wed, 07 Nov 2018 23:13:30 +0800</pubDate><description><![CDATA[
import numpy as np
from numpy import array
import math
def loadDataSet(): #导入数据
    postingList=[['青绿', '蜷缩', '浊响', '清晰', '凹陷', '硬滑', ],
                 ['乌黑', '蜷缩', '沉闷', '清晰', '凹陷', '硬滑', ],
     ...]]></description><category></category></item><item><title><![CDATA[python单链表构建]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/83789542</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/83789542</guid><author>shaobing_</author><pubDate>Tue, 06 Nov 2018 16:26:56 +0800</pubDate><description><![CDATA[
class Node(object):
    def __init__(self,elem):
        self.elem = elem
        self.next = None

class SingleLinkList(object):
    &quot;&quot;&quot;初始&quot;&quot;&quot;
    def __init__(self,node=None):
        self._head = n...]]></description><category></category></item><item><title><![CDATA[机器学习决策树如何学习]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/83107231</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/83107231</guid><author>shaobing_</author><pubDate>Wed, 17 Oct 2018 11:34:30 +0800</pubDate><description><![CDATA[观看B站决策树视频：https://www.bilibili.com/video/av26086646/?p=6
结合西瓜书配合博客：https://blog.youkuaiyun.com/u012328159/article/details/79413610
了解每一个过程

问题：缺失值更新的权值到底怎么得来的，分支数的倒数？...]]></description><category></category></item><item><title><![CDATA[双向循环链表实践]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/72807153</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/72807153</guid><author>shaobing_</author><pubDate>Tue, 30 May 2017 01:02:20 +0800</pubDate><description><![CDATA[观看小甲鱼视频：
要求实现用户输入一个数使得26个字母发生变化，例如输入3输出结果：
DEFGHIJKLMNOPQRSTUVWXYZABC
输出-3得到结果
XYZABCDEFHIJKLMNOPQRSTUVW
#include
#include
#define OK 1
#define ERROR 0

typedef  char ElemType;
typedef int Status]]></description><category></category></item><item><title><![CDATA[数据结构（循环链表）实现约瑟夫问题]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/72799786</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/72799786</guid><author>shaobing_</author><pubDate>Mon, 29 May 2017 09:36:37 +0800</pubDate><description><![CDATA[#include
#include

typedef struct node
{
	int data;
	struct node *next;
}node;

node *create(int n)
{
	int i;
	node *p = NULL,*head;
	node *temp;
	head = (node*)malloc(sizeof(node));
	p=head;


	for(i]]></description><category></category></item><item><title><![CDATA[1001. 害死人不偿命的(3n+1)猜想 (15)]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/72772455</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/72772455</guid><author>shaobing_</author><pubDate>Fri, 26 May 2017 18:07:16 +0800</pubDate><description><![CDATA[分析：输入样例3，
第一步3为奇数，把3*3+1切一半得到5
第二步5为奇数，3*5+1得16，16为偶数，切得8。
第三步8为偶数，切得4。
第四步，4为偶数，切得2
第五步，2为偶数，切得1
即主要步骤，判断是否为1，不为1，判断奇偶性，从而得到新的数字。
注意：输入输出格式（别去额外添加任何输入输出提示，否则报错）
#include
int main(){
	int n,i=]]></description><category></category></item><item><title><![CDATA[湖大C语言程序设计7]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/70833778</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/70833778</guid><author>shaobing_</author><pubDate>Wed, 26 Apr 2017 23:23:22 +0800</pubDate><description><![CDATA[C语言编程：一个数的各位数字倒过来所得到的新数叫原数的反序数.
一个数的各位数字倒过来所得到的新数叫原数的反序数.如果一个数等于它的反序数，则称它为对称数或回文数。求1993以内的二进制对称数
#include
void main()
{
	int i,j,k,n,a[11]={0};
	for(i=1;i<=1993;i++){
		n=i;
		k=0;
		while(n>0){]]></description><category></category></item><item><title><![CDATA[湖大C语言设计题6]]></title><link>https://blog.youkuaiyun.com/shaobing_/article/details/70833628</link><guid>https://blog.youkuaiyun.com/shaobing_/article/details/70833628</guid><author>shaobing_</author><pubDate>Wed, 26 Apr 2017 23:11:57 +0800</pubDate><description><![CDATA[编写程序，输出用一元人民币兑换成一分，二分，五分硬币的不同兑换方法

#include
void main()
{
	int i,j,m,a;
	for(i=0;i<=20;i++)
	{
		for(j=0;j<=50;j++)
		{
			for(m=0;m<=100;m++)
			{
				a=1*m+2*j+5*i;
					if(a==100)
					{
						pr]]></description><category></category></item></channel></rss>