<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[aNoobCoder的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/aNoobCoder</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; aNoobCoder]]></copyright><item><title><![CDATA[python基于子进程和临时文件的命令执行]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79814559</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79814559</guid><author>aNoobCoder</author><pubDate>Wed, 04 Apr 2018 11:01:27 +0800</pubDate><description><![CDATA[# coding: utf-8

import os
import re
import sys
import time
import multiprocessing
import tempfile
from multiprocessing import Process
import subprocess
from .Tools import JsonTools

class IOStatColle...]]></description><category></category></item><item><title><![CDATA[条形图中的最大矩形面积]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79324601</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79324601</guid><author>aNoobCoder</author><pubDate>Wed, 14 Feb 2018 10:41:53 +0800</pubDate><description><![CDATA[问题描述    问题描述见这位的博客http://blog.youkuaiyun.com/jingsuwen1/article/details/51577983。这个比较简单，直接上代码吧。//比较函数，快排用
int cmp ( const void *a , const void *b )
{
    return *(int *)a - *(int *)b;
}

//条形图中的最大矩形面积
int M...]]></description><category></category></item><item><title><![CDATA[DP之数塔问题]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79323426</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79323426</guid><author>aNoobCoder</author><pubDate>Tue, 13 Feb 2018 21:53:19 +0800</pubDate><description><![CDATA[基本思路    比较简单的动态规划问题，自底向上的求解也比较容易理解。代码还可以继续优化，可以利用下三家矩阵的方法优化空间（为了方便描述，只是简单的实现）。    DP问题主要就是找子问题且把子问题的最优解存储起来，防止重复计算，看注释吧。代码//
// Created by Coder。
#include &amp;lt;iostream&amp;gt;

using namespace std;

//a存数...]]></description><category></category></item><item><title><![CDATA[01背包问题的一般DP求解]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79323089</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79323089</guid><author>aNoobCoder</author><pubDate>Tue, 13 Feb 2018 20:43:42 +0800</pubDate><description><![CDATA[老代码了，记录一下吧。借鉴了一个博客，我对代码加了点注释，那个博客找不到了，也没法贴地址//01背包问题
int bag()
{
    //注意--体积和花费都是正整数
    //a[i][j]代表前i件物品可以放入j体积的背包中的最大价值(前i件物品并不一定都放的进去)
    //数组的0下标都未使用
    int a[6][13] = {{0}};
    int val[6] = {...]]></description><category></category></item><item><title><![CDATA[图的非递归遍历(深搜和广搜)]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79321561</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79321561</guid><author>aNoobCoder</author><pubDate>Tue, 13 Feb 2018 14:50:22 +0800</pubDate><description><![CDATA[//
// Created by Coder
//

#include &amp;lt;iostream&amp;gt;
#include &amp;lt;vector&amp;gt;
#include &amp;lt;stack&amp;gt;
#include &amp;lt;queue&amp;gt;

using namespace std;

class DirectedGraph{

private:
    // 最大顶点数
    const ...]]></description><category></category></item><item><title><![CDATA[链表的翻转]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79318939</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79318939</guid><author>aNoobCoder</author><pubDate>Mon, 12 Feb 2018 21:24:57 +0800</pubDate><description><![CDATA[//链表反转
LinkList reverse(LinkList head){
    if(head == NULL || head-&amp;gt;next == NULL)
        return head;
    LinkList pfirst, pnext = head-&amp;gt;next ,c;
    //链首节点最后变为链尾节点
    pfirst-&amp;gt;next = NULL;...]]></description><category></category></item><item><title><![CDATA[查找二叉树的指定节点及根节点到该节点的路径]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79318932</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79318932</guid><author>aNoobCoder</author><pubDate>Mon, 12 Feb 2018 21:23:38 +0800</pubDate><description><![CDATA[//查找二叉树指定节点
bool hasNode(TreeNode* pRoot, TreeNode* pNode){
    if(pRoot == pNode)
        return true;
    bool has = false;
    if(pRoot-&amp;gt;lchild != NULL)
        has = hasNode(pRoot-&amp;gt;lchild, p...]]></description><category></category></item><item><title><![CDATA[二叉树的非递归遍历]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79318924</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79318924</guid><author>aNoobCoder</author><pubDate>Mon, 12 Feb 2018 21:22:30 +0800</pubDate><description><![CDATA[typedef struct TreeNode{
    int value;
    struct TreeNode *lchild, *rchild;
}TreeNode;

//二叉树的先序遍历非递归
void PreOrderTraverse(TreeNode *root){
    if(root == NULL)
        return;
    TreeNode *pNode;...]]></description><category></category></item><item><title><![CDATA[查询链表的倒数第k个位置及其变形]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79305331</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79305331</guid><author>aNoobCoder</author><pubDate>Sat, 10 Feb 2018 16:11:23 +0800</pubDate><description><![CDATA[思路    这个也比较简单，和判断链表是否有环的思路类似，声明两个指针p1、p2指向链表首, 想让p2走k步，然后p1和p2一起走，直到p2到达链表尾部。//查找链表倒数第k个元素

LinkNode *getLastK(LinkNode *head, int k){
    int counter = k;
    LinkNode *p1 = head, *p2 = head;
    whi...]]></description><category></category></item><item><title><![CDATA[判断链表是否有环]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79305275</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79305275</guid><author>aNoobCoder</author><pubDate>Sat, 10 Feb 2018 16:05:10 +0800</pubDate><description><![CDATA[思路    两个指针p1和p2，从链首开始，p1每次走一步，p2每次走两步，一直循环下去。会出现两种情况    1.当p2为NULL时停止，说明无环    2.p2追上p1说明有环#include &amp;lt;iostream&amp;gt;

using namespace std;

//判断链表是否有环

typedef struct LNode{
    int val;
    struct LNo...]]></description><category></category></item><item><title><![CDATA[判断二叉排序树]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/79305060</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/79305060</guid><author>aNoobCoder</author><pubDate>Sat, 10 Feb 2018 15:34:56 +0800</pubDate><description><![CDATA[前言    二叉排序树的判断，我一开始的想法是根据定义，每次判断左孩子&amp;lt;=根节点&amp;lt;=右孩子，但是写着写着发现不对，我当时的程序有一个这样致命的错误：        102                 12              5            16类似于这样的树也会被判断为正确。要解决这个问题也不是不行，就是每次在判断的时候要顺带判断所有祖先节点，觉得有些麻烦。正确的...]]></description><category></category></item><item><title><![CDATA[redis在Windows环境配置配置]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/72429615</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/72429615</guid><author>aNoobCoder</author><pubDate>Wed, 17 May 2017 20:05:22 +0800</pubDate><description><![CDATA[我参考的这篇博客 http://blog.youkuaiyun.com/joyhen/article/details/47358999 ：P]]></description><category></category></item><item><title><![CDATA[mina之基本使用]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/70877935</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/70877935</guid><author>aNoobCoder</author><pubDate>Thu, 27 Apr 2017 20:24:23 +0800</pubDate><description><![CDATA[创建服务端程序
相关依赖包
<dependency>
    <groupId>org.apache.mina</groupId>
    <artifactId>mina-core</artifactId>
    <version>2.0.16</version>
</dependency>
服务端程序
package com.mina.server;import org.apache.mina]]></description><category></category></item><item><title><![CDATA[安卓之service常用用法详解]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/70877648</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/70877648</guid><author>aNoobCoder</author><pubDate>Thu, 27 Apr 2017 20:03:21 +0800</pubDate><description><![CDATA[安卓一直是半吊子水平，在写一个小东西时，发现自己对service的理解还不够，特总结如下：service的创建public class MinaService extends Service{    private ConnectionThread thread;
    @Override
    public void onCreate() {
        super.onCreate();]]></description><category></category></item><item><title><![CDATA[pymongo.errors.ServerSelectionTimeoutError: 127.0.0.1:27017: [WinError 10061]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/70492461</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/70492461</guid><author>aNoobCoder</author><pubDate>Sun, 23 Apr 2017 11:00:21 +0800</pubDate><description><![CDATA[原因没有安装或启动本地的mongoDB服务引起的创建数据库路径并初始化mongod.exe --dbpath F:\mangoDBData\db创建服务官员员身份进入monggo的bin目录 运行如下命令mongod.exe --bind_ip 127.0.0.1 --logpath "F:\mangoDBData\dbConf\mongodb.log" --logappend --dbpath "]]></description><category></category></item><item><title><![CDATA[MongoDB 配置时无法连接 127.0.0.1:27017 问题解决方式]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/70489133</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/70489133</guid><author>aNoobCoder</author><pubDate>Sun, 23 Apr 2017 10:34:06 +0800</pubDate><description><![CDATA[错误代码：error: couldn’t connect to server 127.0.0.1:27017 src/mongo/shell/mongo.js解决方式： 
1、先打开\bin 使用命令 mongod –dbpath指定db路径 
2、重新打开一个DOS进入\bin 再启动mongo]]></description><category></category></item><item><title><![CDATA[python爬虫进阶]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/70338251</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/70338251</guid><author>aNoobCoder</author><pubDate>Fri, 21 Apr 2017 20:08:31 +0800</pubDate><description><![CDATA[发现一个博客写的比较不错 特刺记录http://cuiqingcai.com/category/technique/python]]></description><category></category></item><item><title><![CDATA[解决ImportError: cannot import name webdriver]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/70337942</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/70337942</guid><author>aNoobCoder</author><pubDate>Fri, 21 Apr 2017 19:42:20 +0800</pubDate><description><![CDATA[最近在写一个Python程序的时候，使用from selenium import webdriver,在run的时候却出现ImportError: cannot import name webdriver的提示，但是在Python IDLE里面跑却没有错误。很是疑惑，谷歌一下才发现有人已经在stackoverflow里面提出类似问题了，原因如下，在当前目录有个明教selenium的文件，Python]]></description><category></category></item><item><title><![CDATA[Python文件操作]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/70318773</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/70318773</guid><author>aNoobCoder</author><pubDate>Fri, 21 Apr 2017 15:31:43 +0800</pubDate><description><![CDATA[一、用Python创建一个新文件，内容是从0到9的整数, 每个数字占一行：f=open('f.txt','w')    # r只读，w可写，a追加for i in range(0,10):f.write(str(i)+'\n')f.close()二、文件内容追加，从0到9的10个随机整数：import randomf=open('f.txt','a')
for i in range(0,10):f.]]></description><category></category></item><item><title><![CDATA[No module named win32api问题解决]]></title><link>https://blog.youkuaiyun.com/aNoobCoder/article/details/70317204</link><guid>https://blog.youkuaiyun.com/aNoobCoder/article/details/70317204</guid><author>aNoobCoder</author><pubDate>Fri, 21 Apr 2017 15:19:26 +0800</pubDate><description><![CDATA[Python是没有自带访问windows系统API的库的，需要下载。库的名称叫pywin32，可以从网上直接下载。以下链接地址可以下载：http://sourceforge.net/projects/pywin32/files%2Fpywin32/   （下载适合你的Python版本）运行以下代码如果出现ImportError: No module named win32api 或者出现 Impor]]></description><category></category></item></channel></rss>