<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[emoheithree的博客]]></title><description><![CDATA[AC会上瘾]]></description><link>https://blog.youkuaiyun.com/emoheithree</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; emoheithree]]></copyright><item><title><![CDATA[Numpy 学习笔记]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/79747509</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/79747509</guid><author>emoheithree</author><pubDate>Thu, 29 Mar 2018 19:11:20 +0800</pubDate><description><![CDATA[Numpy



Numpy 属性

这次我们会介绍几种 numpy 的属性: 
- ndim：维度 
- shape：行数和列数 
- size：元素个数 
使用numpy首先要导入模块

`import numpy as np #为了方便使用numpy 采用np简写“ 
列表转化为矩阵：



array = np.array([[1,2,3],[2,3,4]])  #列表转化为矩阵
prin...]]></description><category></category></item><item><title><![CDATA[LeetCode 46. Permutations]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/78590748</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/78590748</guid><author>emoheithree</author><pubDate>Tue, 21 Nov 2017 11:38:07 +0800</pubDate><description><![CDATA[LeetCode 46. Permutations
Given a collection of distinct numbers,return all possible permutations.
 
For example,
[1,2,3] have the following permutations:
[
 [1,2,3],
 [1,3,2],
 [2,1,3],
 [2,]]></description><category></category></item><item><title><![CDATA[POJ 1068 Parencodings]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/78523526</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/78523526</guid><author>emoheithree</author><pubDate>Mon, 13 Nov 2017 19:07:26 +0800</pubDate><description><![CDATA[Parencodings





Time Limit: 1000MS


Memory Limit: 10000K




Total Submissions: 27370


Accepted: 16089





Description
Let S = s1s2...s2n be a well-formed string of parent]]></description><category></category></item><item><title><![CDATA[POJ 1328 Radar Installation]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77946710</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77946710</guid><author>emoheithree</author><pubDate>Tue, 12 Sep 2017 16:28:32 +0800</pubDate><description><![CDATA[Radar Installation





Time Limit: 1000MS


Memory Limit: 10000K




Total Submissions: 91342


Accepted: 20438





Description
Assume thecoasting is an infinite straight lin]]></description><category></category></item><item><title><![CDATA[LeetCode 40. Combination Sum II]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77942170</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77942170</guid><author>emoheithree</author><pubDate>Tue, 12 Sep 2017 10:26:02 +0800</pubDate><description><![CDATA[LeetCode 40. Combination Sum II
Given acollection of candidate numbers (C) and a target number (T),find all unique combinations in C where the candidatenumbers sums to T.
Each numberin C may only be]]></description><category></category></item><item><title><![CDATA[LeetCode 17. Letter Combinations of a Phone Number]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77937881</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77937881</guid><author>emoheithree</author><pubDate>Mon, 11 Sep 2017 21:05:04 +0800</pubDate><description><![CDATA[17. Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinationsthat the number could represent.
A mapping of digit to letters (just like on the telephonebutto]]></description><category></category></item><item><title><![CDATA[poj  3094 Quicksum]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77923038</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77923038</guid><author>emoheithree</author><pubDate>Sun, 10 Sep 2017 16:43:05 +0800</pubDate><description><![CDATA[poj  3094 Quicksum 水
 
Quicksum





Time Limit: 1000MS


Memory Limit: 65536K




Total Submissions: 17095


Accepted: 11865





Description
A checksum is analgorithm that]]></description><category></category></item><item><title><![CDATA[POJ 2255 Tree Recovery]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77922776</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77922776</guid><author>emoheithree</author><pubDate>Sun, 10 Sep 2017 16:11:27 +0800</pubDate><description><![CDATA[Tree Recovery





Time Limit: 1000MS


Memory Limit: 65536K




Total Submissions: 15363


Accepted: 9510





Description
Little Valentineliked playing with binary trees very]]></description><category></category></item><item><title><![CDATA[poj 3006 Dirichlet's Theorem on Arithmetic Progressions]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77917554</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77917554</guid><author>emoheithree</author><pubDate>Sat, 09 Sep 2017 20:19:26 +0800</pubDate><description><![CDATA[poj 3006 Dirichlet's Theorem onArithmetic Progressions
Dirichlet's Theorem on Arithmetic Progressions





Time Limit: 1000MS


Memory Limit: 65536K




Total Submissions: 19133


Ac]]></description><category></category></item><item><title><![CDATA[POJ – 1503 Integer Inquiry  Integer Inquiry]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77917462</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77917462</guid><author>emoheithree</author><pubDate>Sat, 09 Sep 2017 20:04:16 +0800</pubDate><description><![CDATA[POJ –1503 Integer Inquiry 
Integer Inquiry





Time Limit: 1000MS


Memory Limit: 10000K




Total Submissions: 34728


Accepted: 13523





Description
One of the firstusers]]></description><category></category></item><item><title><![CDATA[POJ 2739 Sum of Consecutive Prime Numbers]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77869304</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77869304</guid><author>emoheithree</author><pubDate>Wed, 06 Sep 2017 17:37:34 +0800</pubDate><description><![CDATA[POJ 2739 Sum of Consecutive Prime Numbers
Sum of Consecutive Prime Numbers





Time Limit: 1000MS


Memory Limit: 65536K




Total Submissions: 26176


Accepted: 14204





De]]></description><category></category></item><item><title><![CDATA[POJ  2159  Ancient Cipher]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77867558</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77867558</guid><author>emoheithree</author><pubDate>Wed, 06 Sep 2017 15:55:47 +0800</pubDate><description><![CDATA[POJ  2159  Ancient Cipher
 
Ancient Cipher





Time Limit: 1000MS


Memory Limit: 65536K




Total Submissions: 35432


Accepted: 11550





Description
Ancient Romanempire ]]></description><category></category></item><item><title><![CDATA[POJ 3299 Humidex]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77853554</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77853554</guid><author>emoheithree</author><pubDate>Tue, 05 Sep 2017 17:03:30 +0800</pubDate><description><![CDATA[Adapted fromWikipedia, the free encyclopedia
The humidex is ameasurement used by Canadian meteorologists to reflect the combined effect ofheat and humidity. It differs from the heat index used in the]]></description><category></category></item><item><title><![CDATA[LeetCode 39. Combination Sum]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/77835839</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/77835839</guid><author>emoheithree</author><pubDate>Mon, 04 Sep 2017 11:39:08 +0800</pubDate><description><![CDATA[Given a set ofcandidate numbers (C) (without duplicates) and atarget number (T), find all unique combinations in C wherethe
 candidate numbers sums to T.
The same repeatednumber may be chosen from C]]></description><category></category></item><item><title><![CDATA[遗传算法 与旅行商问题]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/72639502</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/72639502</guid><author>emoheithree</author><pubDate>Tue, 23 May 2017 14:30:27 +0800</pubDate><description><![CDATA[遗传算法通常实现方式为一种计算机模拟。对于一个最优化问题，一定数量的候选解（称为个体）可抽象表示为染色体，使种群向更好的解进化。传统上，解用二进制表示（即0和1的串），但也可以用其他表示方法。进化从完全随机个体的种群开始，之后一代一代发生。在每一代中评价整个种群的适应度，从当前种群中随机地选择多个个体（基于它们的适应度），通过自然选择和突变产生新的生命种群，该种群在算法的下一次迭代中成为当前种群。]]></description><category></category></item><item><title><![CDATA[alpha beta 剪枝算法]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/72630184</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/72630184</guid><author>emoheithree</author><pubDate>Mon, 22 May 2017 21:13:43 +0800</pubDate><description><![CDATA[alpha-β修剪的好处在于可以消除搜索树的分支。这样，搜索时间可以限制在“更有希望”的子​​树中，并且可以在同一时间执行更深入的搜索。该算法和极小化极大算法一样，都是分支限界类算法。若节点搜索顺序达到最佳优化或近似最佳优化（将最佳选择排在各节点首位），则同样时间内搜索深度可达极小化极大算法的两倍多。]]></description><category></category></item><item><title><![CDATA[LeetCode 45. Jump Game II]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/68508802</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/68508802</guid><author>emoheithree</author><pubDate>Thu, 30 Mar 2017 21:26:21 +0800</pubDate><description><![CDATA[45. Jump Game II
Given an array of non-negative integers, you are initiallypositioned at the first index of the array.
Each element in the array represents your maximum jump length atthat position.]]></description><category></category></item><item><title><![CDATA[LeetCode 42. Trapping Rain Water]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/68483579</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/68483579</guid><author>emoheithree</author><pubDate>Thu, 30 Mar 2017 10:03:50 +0800</pubDate><description><![CDATA[Given n non-negativeintegers representing an elevation map where the width of each
 bar is 1,compute how much water it is able to trap after raining.
For example, 

Given [0,1,0,2,1,0,1,3,2,1,2,1]]]></description><category></category></item><item><title><![CDATA[LeetCode 41. First Missing Positive]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/68100325</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/68100325</guid><author>emoheithree</author><pubDate>Wed, 29 Mar 2017 20:56:30 +0800</pubDate><description><![CDATA[41. First Missing Positive
Given an unsorted integer array, find the first missing positiveinteger.
For example,
Given [1,2,0] return 3,
and [3,4,-1,1] return 2.
Your algorithm should run in O(n)]]></description><category></category></item><item><title><![CDATA[freopen---重定向文件流----解决刷oj时手动输入的烦恼]]></title><link>https://blog.youkuaiyun.com/emoheithree/article/details/66968787</link><guid>https://blog.youkuaiyun.com/emoheithree/article/details/66968787</guid><author>emoheithree</author><pubDate>Mon, 27 Mar 2017 10:41:09 +0800</pubDate><description><![CDATA[刷oj时每次都手动输入很不方便---好在输入段其实也是一种流我们可以使用文件定向到标准输入与输出流来简便处理输入与输出问题。


先接受下函数
	FILE * freopen ( const char * filename, const char * mode, FILE * stream );
	
【参数说明】

filename: 要打开的文件名

mode: 文件打开的模式，和fope]]></description><category></category></item></channel></rss>