<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Z_Pythagoras的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Z_Pythagoras</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Z_Pythagoras]]></copyright><item><title><![CDATA[Leetcode 820. 单词的压缩编码]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/105168637</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/105168637</guid><author>Z_Pythagoras</author><pubDate>Sat, 28 Mar 2020 21:12:52 +0800</pubDate><description><![CDATA[反向字典序排序，排序后遍历求解
class Solution {
private:
    static bool cmp(string&amp; a, string&amp; b) {
        int ia = a.length() - 1, ib = b.length() - 1;
        while (ia &amp;&amp; ib) {
            if (a...]]></description><category></category></item><item><title><![CDATA[Leetcode 面试题 16.03. 交点]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/105112072</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/105112072</guid><author>Z_Pythagoras</author><pubDate>Thu, 26 Mar 2020 10:19:22 +0800</pubDate><description><![CDATA[class Solution {
private:
    bool NumBetween (int a, int m, int n) {
        int small = min(m, n), large = max(m, n);
        return a  &gt;= small &amp;&amp;  a &lt;= large;
    }
    bool NumBetwe...]]></description><category></category></item><item><title><![CDATA[Leetcode 89. 格雷码生成]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/105061476</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/105061476</guid><author>Z_Pythagoras</author><pubDate>Mon, 23 Mar 2020 23:59:22 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector&lt;int&gt; grayCode(int n) {
        vector&lt;int&gt; grayList(1 &lt;&lt; n, 0);
        /*
        if (n == 0) {
            return grayList;
        }
        el...]]></description><category></category></item><item><title><![CDATA[读取xml文件指定内容]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/105060419</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/105060419</guid><author>Z_Pythagoras</author><pubDate>Mon, 23 Mar 2020 22:56:32 +0800</pubDate><description><![CDATA[def read_xml(path, tag_name='QW', attribute_name='value'):
    dom_tree = xml_parse(path)
    root_node = dom_tree.documentElement
    tag_list = root_node.getElementsByTagName(tag_name)
    details =...]]></description><category></category></item><item><title><![CDATA[斐波那契数列——矩阵快速幂解法]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/105037389</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/105037389</guid><author>Z_Pythagoras</author><pubDate>Sun, 22 Mar 2020 22:18:33 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;algorithm&gt;
using namespace std;
 
typedef long long ll;
const ll mod = 1000000007;
 
struct Matrix {
    ll num[2][2];
    void initial() {
        num[0][0] ...]]></description><category></category></item><item><title><![CDATA[PYNLPIR中文分词，生成词云图片]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/105036744</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/105036744</guid><author>Z_Pythagoras</author><pubDate>Sun, 22 Mar 2020 21:52:52 +0800</pubDate><description><![CDATA[from collections import Counter
import matplotlib.pyplot as plt
import wordcloud
import pynlpir

with open('./paper.txt', encoding='utf-8') as text:
    contents = text.read()

# 分词
pynlpir.open()    ...]]></description><category></category></item><item><title><![CDATA[Python 递归读取某文件夹下全部指定后缀名文件]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/105035994</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/105035994</guid><author>Z_Pythagoras</author><pubDate>Sun, 22 Mar 2020 21:24:34 +0800</pubDate><description><![CDATA[import os


def all_files(path, file_type):    # 生成path路径下全部file_type类型文件绝对路径列表
    f_list = []

    def files_list(father_path):
        sub_path = os.listdir(father_path)    # 读取父路径下全部文件或文件夹名称
     ...]]></description><category></category></item><item><title><![CDATA[Anaconda 常用命令]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/104984378</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/104984378</guid><author>Z_Pythagoras</author><pubDate>Fri, 20 Mar 2020 10:27:53 +0800</pubDate><description><![CDATA[查看现有环境
conda info -e


]]></description><category></category></item><item><title><![CDATA[算符优先文法——中缀表达式转换为后缀表达式并求值]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/104743280</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/104743280</guid><author>Z_Pythagoras</author><pubDate>Sun, 08 Mar 2020 23:15:10 +0800</pubDate><description><![CDATA[算符优先文法——中缀表达式转换为后缀表达式并求值
根据编译原理相关知识，我们可将整个程序分为三个部分，词法分析，文法分析，后缀表达式计算，在文法分析中会涉及到运算符优先级的判断。接下来我将分模块对代码进行解释，希望可以对读者理解算符优先文法、词法分析有和后缀表达式求值有所帮助。
代码可以识别包含括号的基本四则运算和乘方运算，可以识别浮点数，未进行错误运算时的错误处理。
运算符优先级
如数组sp所示...]]></description><category></category></item><item><title><![CDATA[Leetcode 67. 使用栈和全加器实现二进制求和(JAVA)]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/83933931</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/83933931</guid><author>Z_Pythagoras</author><pubDate>Sat, 10 Nov 2018 22:21:37 +0800</pubDate><description><![CDATA[使用栈和全加器实现二进制求和(JAVA)
使用栈实现输入二进制串反序，使用加法器实现每一位求和
加法器核心代码:
s = a ^ b ^ c; //求和结果
c = (a &amp;amp;amp;amp;amp; b) | (a &amp;amp;amp;amp;amp; c) | (b &amp;amp;amp;amp;amp; c); //进位

题目: Leetcode 二进制求和
给定两个二进制字符串，返回他们的和（用二进制表示）。
输入为非空字符串且只包含数字 1 和 0。
示例...]]></description><category></category></item><item><title><![CDATA[Sorting]]></title><link>https://blog.csdn.net/Z_Pythagoras/article/details/78919307</link><guid>https://blog.csdn.net/Z_Pythagoras/article/details/78919307</guid><author>Z_Pythagoras</author><pubDate>Thu, 28 Dec 2017 10:33:15 +0800</pubDate><description><![CDATA[Sorting#define MAXN 1005    //数组最大长度
int num[MAXN];    //待排序数组
int n;    //数组中元素个数Insertion Sort直接插入排序//设置哨兵num[0], 为在查找插入位置的过程中避免数组下标越界
void InsertSort() {
    int i, j;
    for (i = 2; i <= n; i++)]]></description><category></category></item></channel></rss>