<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Coder_zyq的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Coder_zyq</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Coder_zyq]]></copyright><item><title><![CDATA[thrift0.12.0 golang.org 解决办法]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/114387517</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/114387517</guid><author>Coder_zyq</author><pubDate>Fri, 05 Mar 2021 11:32:54 +0800</pubDate><description><![CDATA[首先是安装各种依赖，这一步有问题找其他教程
make的时候，（make -j 就是多线程编译。）出现了golang.org/x/net
一开始升级go为1.16 ，好使用go proxy，然后不行


使用蓝灯，
使用代理不行，
设置http_proxy,
设置host文件，那个ip就ping一直失败


然后发现是要下载gomock和golang/x/net这两个包
重点来了，放在你的$ GOPATH不管用，同时要放在你的$ GOROOT/src中，因为我的gopath和goroot不在同一文件夹下。一.]]></description><category></category></item><item><title><![CDATA[boost pyconfig.h 修复方法]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/114368601</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/114368601</guid><author>Coder_zyq</author><pubDate>Thu, 04 Mar 2021 15:03:08 +0800</pubDate><description><![CDATA[问题
anaconda3环境下安装boost，找不到pyconfig.h
解决办法：


首先确保python的requirement.txt 是否成功安装


输入以下代码
pip install python-dev
pip install python3-dev
pip install libpython-dev
pip install libpython3-dev
pip install libpython3.7-dev


查看boost文件夹下 project_config.jam中python]]></description><category></category></item><item><title><![CDATA[go语言http调用Tushare财经数据包]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/111033948</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/111033948</guid><author>Coder_zyq</author><pubDate>Fri, 11 Dec 2020 13:59:57 +0800</pubDate><description><![CDATA[go语言http调用Tushare财经数据包
Tushare平台介绍

Tushare平台网址 https://tushare.pro/document/1，网址上就有下载安装以及数据获取的方式
免费获取，数据准确，适合量化投资分析师（Quant），对金融市场进行大数据分析的企业和个人，开发以证券为基础的金融类产品和解决方案的公司，正在学习利用python进行数据分析的人使用。

使用go + http方式调用Tushare数据
// 具体http网站查看https://tushare.pro/docume]]></description><category></category></item><item><title><![CDATA[算法概论第八章课后题--8.3]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/79051800</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/79051800</guid><author>Coder_zyq</author><pubDate>Sat, 13 Jan 2018 15:41:35 +0800</pubDate><description><![CDATA[算法概论第八章课后题–8.3



题目描述

STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) and 
an integer k, find a satisfying assignment in which at most k variables are tr]]></description><category></category></item><item><title><![CDATA[LeetCode --Best Time to Buy and Sell Stock III]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/79051352</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/79051352</guid><author>Coder_zyq</author><pubDate>Sat, 13 Jan 2018 14:44:20 +0800</pubDate><description><![CDATA[LeetCode –Best Time to Buy and Sell Stock III


  技术与社会生态的相互作用，使得技术发展经常带来更深远的问题，远远超出了技术设备的直接目的和运作本身，同样的技术，引入不同的环境，或在不同条件下，会带来非常不同的结果





LeetCode Best Time to Buy and Sell Stock III
题目描述
算法解释
代码]]></description><category></category></item><item><title><![CDATA[LeetCode--Best Time to Buy and Sell Stock II]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/79051296</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/79051296</guid><author>Coder_zyq</author><pubDate>Sat, 13 Jan 2018 14:38:40 +0800</pubDate><description><![CDATA[Best Time to Buy and Sell Stock II




Best Time to Buy and Sell Stock II
题目描述
算法解释
代码









题目描述

Say you have an array for which the ith element is the price of a given stock on day i.

Design an]]></description><category></category></item><item><title><![CDATA[LeetCode- kadane algorithm]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/79050193</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/79050193</guid><author>Coder_zyq</author><pubDate>Sat, 13 Jan 2018 11:17:31 +0800</pubDate><description><![CDATA[LeetCode - kadane algorithm]]></description><category></category></item><item><title><![CDATA[LeetCode- Best Time to Buy and Sell Stock]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/79049537</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/79049537</guid><author>Coder_zyq</author><pubDate>Sat, 13 Jan 2018 09:39:54 +0800</pubDate><description><![CDATA[LeetCode- Best Time to Buy and Sell Stock




LeetCode- Best Time to Buy and Sell Stock
题目描述
算法理解
代码块













题目描述

Say you have an array for which the ith element is the price of a given stock o]]></description><category></category></item><item><title><![CDATA[LeetCode -Best Time to Buy and Sell Stock with Cooldown]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/79049513</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/79049513</guid><author>Coder_zyq</author><pubDate>Sat, 13 Jan 2018 09:35:22 +0800</pubDate><description><![CDATA[LeetCode -Best Time to Buy and Sell Stock with Cooldown




LeetCode -Best Time to Buy and Sell Stock with Cooldown
题目描述
算法解释
代码









题目描述

Say you have an array for which the ith element is the p]]></description><category></category></item><item><title><![CDATA[LeetCode--Add two Number II]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/79027787</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/79027787</guid><author>Coder_zyq</author><pubDate>Wed, 10 Jan 2018 20:14:24 +0800</pubDate><description><![CDATA[LeetCode–Add two Number II




LeetCodeAdd two Number II
题目描述
算法解释
代码











题目描述

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes]]></description><category></category></item><item><title><![CDATA[LeetCode- Add two number I]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/79026078</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/79026078</guid><author>Coder_zyq</author><pubDate>Wed, 10 Jan 2018 17:09:18 +0800</pubDate><description><![CDATA[LeetCode- Add two number I]]></description><category></category></item><item><title><![CDATA[leetCode -Counting Bits]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78991769</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78991769</guid><author>Coder_zyq</author><pubDate>Sat, 06 Jan 2018 21:36:28 +0800</pubDate><description><![CDATA[leetCode 解题报告之Counting Bits]]></description><category></category></item><item><title><![CDATA[LeetCode - jump game II]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78547161</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78547161</guid><author>Coder_zyq</author><pubDate>Thu, 16 Nov 2017 09:18:11 +0800</pubDate><description><![CDATA[LeetCode - jump game II]]></description><category></category></item><item><title><![CDATA[LeetCode- Jump game]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78535332</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78535332</guid><author>Coder_zyq</author><pubDate>Tue, 14 Nov 2017 21:25:08 +0800</pubDate><description><![CDATA[jump game I]]></description><category></category></item><item><title><![CDATA[py 十大原则]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78535269</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78535269</guid><author>Coder_zyq</author><pubDate>Tue, 14 Nov 2017 21:19:50 +0800</pubDate><description><![CDATA[The Zen of Python]]></description><category></category></item><item><title><![CDATA[LeetCode - Maximum Length Of Pair Chain(算法)]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78366414</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78366414</guid><author>Coder_zyq</author><pubDate>Fri, 27 Oct 2017 16:31:42 +0800</pubDate><description><![CDATA[算法概论之LeetCode- Maximum Length Of Pair Chain




算法概论之LeetCode- Maximum Length Of Pair Chain
题目描述
样例输入输出
算法描述













1. 题目描述

You are given n pairs of numbers. In every pair, the first number is]]></description><category></category></item><item><title><![CDATA[动态规划--LIS与LCS]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78353681</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78353681</guid><author>Coder_zyq</author><pubDate>Thu, 26 Oct 2017 14:43:12 +0800</pubDate><description><![CDATA[动态规划动态规划
动态规划DP的基本描述
动态规划的核心
动态规划与贪心算法分治的区别
LIS最长递增子序列问题1. 动态规划(DP)的基本描述
  dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems.
动态]]></description><category></category></item><item><title><![CDATA[贪心算法之Assign Cookie-leetcode]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78245090</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78245090</guid><author>Coder_zyq</author><pubDate>Sun, 15 Oct 2017 22:41:27 +0800</pubDate><description><![CDATA[LeetCode-Assign Cookie




LeetCode-Assign Cookie
问题描述
详细讲解
代码









1. 问题描述


  Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at mos]]></description><category></category></item><item><title><![CDATA[LeetCode-Majority Element]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78008660</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78008660</guid><author>Coder_zyq</author><pubDate>Sun, 17 Sep 2017 10:16:52 +0800</pubDate><description><![CDATA[Majority Element
Majority Element
题目描述
算法
1  暴力求解n2
2  桶排序  n较小
3 找中位数问题
4 Divide and conquer
5 Randomization
6 Boyer-Moore Algorithm1. 题目描述
  Given an array of size n, find the majority element. The m]]></description><category></category></item><item><title><![CDATA[LeetCode-Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/Coder_zyq/article/details/78008222</link><guid>https://blog.youkuaiyun.com/Coder_zyq/article/details/78008222</guid><author>Coder_zyq</author><pubDate>Sun, 17 Sep 2017 08:54:51 +0800</pubDate><description><![CDATA[最大子序列和问题
最大子序列和问题
题目描述
解题思路
直接求解On-动态规划
利用分治的方法Onlogn
代码1. 题目描述
  Find the contiguous subarray within an array (containing at least one number) which has the largest sum. 
  Example given the array [-2]]></description><category></category></item></channel></rss>