<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[jiangerchi的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/jiangerchi</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jiangerchi]]></copyright><item><title><![CDATA[QQ音乐爬虫之放弃的路]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/105618528</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/105618528</guid><author>jiangerchi</author><pubDate>Sun, 19 Apr 2020 17:24:52 +0800</pubDate><description><![CDATA[QQ 音乐网页端爬虫之心酸历程。。
]]></description><category></category></item><item><title><![CDATA[python多线程和多进程和异步]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/80624281</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/80624281</guid><author>jiangerchi</author><pubDate>Fri, 08 Jun 2018 15:52:04 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/whatisfantasy/p/6440585.html?utm_source=itdadao&amp;amp;utm_medium=referralhttp://aosabook.org/en/500L/a-web-crawler-with-asyncio-coroutines.html]]></description><category></category></item><item><title><![CDATA[面向对象，国药监化妆品许可证爬取]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/79393896</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/79393896</guid><author>jiangerchi</author><pubDate>Tue, 27 Feb 2018 22:13:36 +0800</pubDate><description><![CDATA[面向函数——>面向对象；
只涉及列表页，详情页没有涉及；
所以只要一个类：CFDA，就够了。/20180225
__author__ = '姜枫渔火'

import requests, time, random
from fake_useragent import UserAgent

class CFDA():
    def __init__(self):
        self.u]]></description><category></category></item><item><title><![CDATA[利用post-data来构造信息抓取艺龙酒店]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/79070332</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/79070332</guid><author>jiangerchi</author><pubDate>Tue, 16 Jan 2018 00:56:25 +0800</pubDate><description><![CDATA[在post请求类型中，有一种利用formdata来进行翻页、搜索的方法，以艺龙为例。/20180112其实，还可以筛选酒店类型：如家，汉庭啊之类的，都在data中，方法都是一样的。/20180115# coding: utf-8
__author__ ='姜枫渔火'
import requests, re, time, random, pandas
from fake_useragent impo...]]></description><category></category></item><item><title><![CDATA[复习bs4，爬去腾讯招聘信息]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/79070298</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/79070298</guid><author>jiangerchi</author><pubDate>Tue, 16 Jan 2018 00:37:10 +0800</pubDate><description><![CDATA[复习一下另一种提取方式：Python根据xpath造的轮子，美味汤。/20170110
复习findAll和select两种提取方法。/20170110
# coding: utf-8
__author__ = '姜枫渔火'
import requests
from bs4 import BeautifulSoup
import json
import sys
from fake_userag]]></description><category></category></item><item><title><![CDATA[利用pymysql爬虫后导入数据库]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78952633</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78952633</guid><author>jiangerchi</author><pubDate>Tue, 02 Jan 2018 15:57:49 +0800</pubDate><description><![CDATA[别总存本地了，爬书内容太大了，存进数据库吧。数据库：MySQL5.5.29；可视化工具：navicat fo mysql。/20180102__author__ = '姜枫渔火'
import requests
import re
import pymysql

conn = pymysql.connect(
    host = 'localhost',
    port = 3306,]]></description><category></category></item><item><title><![CDATA[根据爬虫和tornado搭建百度音乐网站]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78892643</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78892643</guid><author>jiangerchi</author><pubDate>Mon, 25 Dec 2017 14:43:15 +0800</pubDate><description><![CDATA[根据爬虫和tornado搭建百度音乐网站。/20171225

测试：


from tornado import web, httpserver, ioloop

# 逻辑处理模块
class MainPageHandler(web.RequestHandler):
    def get(self, *args, **kwargs):
        # self.write('我的第一个简陋...]]></description><category></category></item><item><title><![CDATA[爬去百度音乐的歌曲，突破不能点播的限制，将其下载。]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78876035</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78876035</guid><author>jiangerchi</author><pubDate>Fri, 22 Dec 2017 18:53:51 +0800</pubDate><description><![CDATA[百度音乐因为限制有些歌曲不能点播，譬如上图的所有歌曲……但其实它们都在百度里隐藏着，

但是我们可以根据其他能点播的歌曲，如林志炫的“单身情歌”，找到规律，从而下载下来。

下面说下整体思路：

1.通过在搜索框里输入“林志炫”得到其歌单界面，点击“单身情歌”的播放按钮会跳转到新页面；

2.在新页面里的network里寻找media的mp3的url，可以发送get请求返回二进制，下载到本地，...]]></description><category></category></item><item><title><![CDATA[校花网爬图片，存到本地。]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78855207</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78855207</guid><author>jiangerchi</author><pubDate>Wed, 20 Dec 2017 17:02:32 +0800</pubDate><description><![CDATA[总的来说，就是将图片转换成二进制，再存下来。/20171219
import requests
import re
from multiprocessing import Pool

def getpage(url):
    response = requests.get(url)
    html = response.text
    return html

def prase(html]]></description><category></category></item><item><title><![CDATA[爬取改版后的新浪微博粉丝评论，利用pandas存储。]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78837910</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78837910</guid><author>jiangerchi</author><pubDate>Mon, 18 Dec 2017 22:40:33 +0800</pubDate><description><![CDATA[模拟登录，抓取改版之后的新浪微博粉丝：昵称，头像，ID，评论。初次利用了pandas写入文件。

# coding: utf-8

from fake_useragent import UserAgent
import re
import requests
import pandas
import time
import random

def get_one_page(url):
    h]]></description><category></category></item><item><title><![CDATA[70. Climbing Stairs]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819999</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819999</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 15:08:45 +0800</pubDate><description><![CDATA[You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given n will be a posi]]></description><category></category></item><item><title><![CDATA[116. Populating Next Right Pointers in Each Node]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819965</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819965</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 15:03:43 +0800</pubDate><description><![CDATA[Given a binary tree
    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }




Populate each next pointer to point to its next right node. ]]></description><category></category></item><item><title><![CDATA[104. Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819930</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819930</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 14:56:04 +0800</pubDate><description><![CDATA[Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

/**
 * Definition for binary tree
]]></description><category></category></item><item><title><![CDATA[111. Minimum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819876</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819876</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 14:51:20 +0800</pubDate><description><![CDATA[Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
核心思想是树的递归遍历，同时注意斜树的存在。

class Soluti]]></description><category></category></item><item><title><![CDATA[21. Merge Two Sorted Lists]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819755</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819755</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 14:31:31 +0800</pubDate><description><![CDATA[Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Merge two sorted linked lists and return it as a new list]]></description><category></category></item><item><title><![CDATA[141. Linked List Cycle]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819692</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819692</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 14:21:59 +0800</pubDate><description><![CDATA[Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?

用C++吧，python创建链表、树啥的总觉得不正规……

/**
 * Definition for singly-linked list.
 * struc]]></description><category></category></item><item><title><![CDATA[53. Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819585</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819585</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 14:02:05 +0800</pubDate><description><![CDATA[Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],

the contiguous subarray [4,-1,2,1]]]></description><category></category></item><item><title><![CDATA[63. Unique Paths II]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819571</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819571</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 13:55:52 +0800</pubDate><description><![CDATA[Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively
 in the ]]></description><category></category></item><item><title><![CDATA[62. Unique Paths]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819557</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819557</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 13:53:15 +0800</pubDate><description><![CDATA[A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the]]></description><category></category></item><item><title><![CDATA[1. Two Sum]]></title><link>https://blog.youkuaiyun.com/jiangerchi/article/details/78819538</link><guid>https://blog.youkuaiyun.com/jiangerchi/article/details/78819538</guid><author>jiangerchi</author><pubDate>Sat, 16 Dec 2017 13:50:41 +0800</pubDate><description><![CDATA[Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the sam]]></description><category></category></item></channel></rss>