<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[funny_fly的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/funny_fly</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; funny_fly]]></copyright><item><title><![CDATA[python爬虫（爬取一部完整小说）]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/82963689</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/82963689</guid><author>funny_fly</author><pubDate>Mon, 08 Oct 2018 09:35:49 +0800</pubDate><description><![CDATA[
用python编写一个简单的爬虫，爬取笔趣阁小说《遮天》。仅供学习，请勿用于商业用途！

#-*-coding:utf-8-*-
import requests
from bs4 import BeautifulSoup
import random

def find_content(f, url):
    res = requests.get(url)
    res.encoding = ...]]></description><category></category></item><item><title><![CDATA[unbutu下shell命令字符串截取报Bad substitution]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/78349282</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/78349282</guid><author>funny_fly</author><pubDate>Thu, 26 Oct 2017 09:24:48 +0800</pubDate><description><![CDATA[环境：Ubuntu 14.04.5 LTS
把aa.log文件中的所有行拼接成字符串并用“|”分割：
aa.log:

aaaaa                                                                                     
bbbbb
ccccc



wf.sh
#!/bin/bash
str_]]></description><category></category></item><item><title><![CDATA[二叉树前序、中序、后序遍历]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/78189488</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/78189488</guid><author>funny_fly</author><pubDate>Tue, 10 Oct 2017 10:08:57 +0800</pubDate><description><![CDATA[根据网络代码优化,可以运行:（有空再追加注释）
#include
#include


typedef char TypeData;
typedef struct stBiTreeNode
{
TypeData data;
struct stBiTreeNode *lchild;
struct stBiTreeNode *rchild;
}BITREENODE;


B]]></description><category></category></item><item><title><![CDATA[union和struct对齐大小问题]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/54602664</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/54602664</guid><author>funny_fly</author><pubDate>Wed, 18 Jan 2017 16:48:23 +0800</pubDate><description><![CDATA[对齐就是要满足存储变量的起始地址与对齐大小余数为0。
对于union，分两步：先算union对齐大小，对齐的大小是取决于union成员中字节对齐最大的那个；再算union实际分配的空间，而分配给union的实际大小不仅要满足是对齐大小的整数倍，同时要满足实际大小不能小于最大成员的大小。
如:
Union U1
{
Char a[9];
Int
b;
};
成员a是char数组，对]]></description><category></category></item><item><title><![CDATA[c语言中内存字节对齐问题]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/54602489</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/54602489</guid><author>funny_fly</author><pubDate>Wed, 18 Jan 2017 16:33:34 +0800</pubDate><description><![CDATA[在C语言面试和考试中经常会遇到内存字节对齐的问题。今天就来对字节对齐的知识进行小结一下。
首先说说为什么要对齐。为了提高效率，计算机从内存中取数据是按照一个固定长度的。以32位机为例，它每次取32个位，也就是4个字节（每字节8个位，计算机基础知识，别说不知道）。字节对齐有什么好处？以int型数据为例，如果它在内存中存放的位置按4字节对齐，也就是说1个int的数据全部落在计算机一次取数的区间内，那]]></description><category></category></item><item><title><![CDATA[oracle数据库死锁问题]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/54020209</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/54020209</guid><author>funny_fly</author><pubDate>Wed, 04 Jan 2017 15:50:21 +0800</pubDate><description><![CDATA[﻿﻿
oracle数据库死锁问题：

1）执行下面SQL，先查看哪些表被锁住了: 
select b.owner,b.object_name,a.session_id,a.locked_mode
from v$locked_object a,dba_objects b
where b.object_id = a.object_id;

2）查处引起死锁的会话
select b.u]]></description><category></category></item><item><title><![CDATA[python学习笔记]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/53690105</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/53690105</guid><author>funny_fly</author><pubDate>Fri, 16 Dec 2016 10:38:55 +0800</pubDate><description><![CDATA[从零开始学python，偶尔记下笔记]]></description><category></category></item><item><title><![CDATA[哈希表的实现（字符串作为key）]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/53690021</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/53690021</guid><author>funny_fly</author><pubDate>Fri, 16 Dec 2016 10:34:48 +0800</pubDate><description><![CDATA[﻿﻿
/*哈希表的实现（字符串作为key）*/
#include
#include
#include
#define HASH_TABLE_LENGTH 100
//哈希表头
typedef struct HASH_HEAD
{
 struct HASH_LINK *next;
}Hash_head;
//单链表，存储数据
typedef struct HASH_LINK]]></description><category></category></item><item><title><![CDATA[双向非循环链表(没有头结点)]]></title><link>https://blog.youkuaiyun.com/funny_fly/article/details/53585326</link><guid>https://blog.youkuaiyun.com/funny_fly/article/details/53585326</guid><author>funny_fly</author><pubDate>Mon, 12 Dec 2016 17:34:48 +0800</pubDate><description><![CDATA[双向非循环链表：虽然没有设置表头，其实是把第一个结点当做表头来处理的。分别实现了：初始化链表、创建链表、从尾部插入链表、获取指定位置结点的值、从头开始遍历链表、给定结点指针分别向前和向后遍历、删除给定位置结点]]></description><category></category></item></channel></rss>