<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[路漫漫其修远兮，吾将上下而求索]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/codetypeman</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; codetypeman]]></copyright><item><title><![CDATA[numpy 数组学习笔记]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/90514558</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/90514558</guid><author>codetypeman</author><pubDate>Fri, 24 May 2019 13:43:52 +0800</pubDate><description><![CDATA[Numpy 数组的维数称为一个秩（rank）.

Numpy中每一个线性数组成为一个轴（axis）,也就是纬度（dimensions）


a=np.array([[1,2,3,4],[4,3,2,1]])
print(a)
[[1 2 3 4]
 [4 3 2 1]]


例如一个二维数组相当于两个一维数组，第一个轴相当于两个底层数组，第二轴相当于底层数组里的数组



Numpy数组的切片（...]]></description><category></category></item><item><title><![CDATA[numpy pad函数]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/90454153</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/90454153</guid><author>codetypeman</author><pubDate>Wed, 22 May 2019 23:41:38 +0800</pubDate><description><![CDATA[在卷积神经网络中一个重要的操作就是padding，翻译为填充。就是把一张图片的作为填上一些像素点，以免使得在卷积过程中，图像边缘的点的信息卷积次数过少，而使信息丢失。



在numpy函数中已经把padding封装好了。

此处重点讨论这函数的具体用法。


import numpy as np
import h5py
import matplotlib.pyplot as plt

a=np...]]></description><category></category></item><item><title><![CDATA[微信小程序开发1——页面跳转与传参]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/89221123</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/89221123</guid><author>codetypeman</author><pubDate>Thu, 11 Apr 2019 22:10:46 +0800</pubDate><description><![CDATA[微信小程序开发类似于web开发，是由WXML标签，WXSS属性，JS控制事件来构成的。

本文主要记录页面跳转与传值中的代码写法。

页面跳转：

首先监听button的事件，用js写事件的时候跳转页面具体代码如下；


&lt;button bindtap="listenerLogin"&gt;登录&lt;/button&gt;

bindtap个人理解相当于一个onclick()事件点击这个组...]]></description><category></category></item><item><title><![CDATA[windows10+mx150+ Cuda9.1+cudnn tensorflow-gpu环境配置]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/88354100</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/88354100</guid><author>codetypeman</author><pubDate>Fri, 08 Mar 2019 16:43:07 +0800</pubDate><description><![CDATA[笔者使用的是python 3.6.5为了保证安装过程顺利，建议使用相同版本的python。

1.先安装CUDA先安装CUDA

 查看自己的显卡对应的cuda版本，没有英伟达独立显卡的自行放弃，打开英伟达控制面板，点帮助——&gt;系统信息——&gt;组件

   -----&gt;



CUAD下载链接——&gt;然后安装，自定义安装，不选vs那个就行了，路径默认。

...]]></description><category></category></item><item><title><![CDATA[Java数组排序]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/84979085</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/84979085</guid><author>codetypeman</author><pubDate>Mon, 17 Dec 2018 13:06:50 +0800</pubDate><description><![CDATA[直接Arrays.sort()方法，默认升序。 


Arrays.sort(a);

要实现降序排列需要实现Comparator&amp;lt;Integer&amp;gt;接口，重写里面的compare()方法；

代码如下


public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		Integer[]a=...]]></description><category></category></item><item><title><![CDATA[Java中String和StringBuilder和StringBuffer的比较]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/84981916</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/84981916</guid><author>codetypeman</author><pubDate>Thu, 13 Dec 2018 08:50:48 +0800</pubDate><description><![CDATA[三者的区别主要在运行速度和线程安全上：
运行速度由快至慢：

StringBuilder &amp;gt; StringBuffer &amp;gt; String；

String 最慢是因为String是字符串常量，而StringBuilder和StringBuffer都是变量：常量是不可修改的，而变量是可以修改的；

例如


String str=&quot;abc&quot;;
System.out.println(str...]]></description><category></category></item><item><title><![CDATA[Java蓝桥杯 16进制转8进制]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/84981871</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/84981871</guid><author>codetypeman</author><pubDate>Thu, 13 Dec 2018 08:39:20 +0800</pubDate><description><![CDATA[问题描述
　　给定n个十六进制正整数，输出它们对应的八进制数。输入格式
　　输入的第一行为一个正整数n （1&amp;lt;=n&amp;lt;=10）。
　　接下来n行，每行一个由0~9、大写字母A~F组成的字符串，表示要转换的十六进制正整数，每个十六进制数长度不超过100000。输出格式
　　输出n行，每行为输入对应的八进制正整数。
　　【注意】
　　输入的十六进制数不会有前导0，比如012A。
　　输出的八...]]></description><category></category></item><item><title><![CDATA[.net JQuery的Ajax方法（wustzz的备考记录）]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/84110148</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/84110148</guid><author>codetypeman</author><pubDate>Thu, 15 Nov 2018 20:33:22 +0800</pubDate><description><![CDATA[JQuery中允许使用Ajax（）方法加载远程数据。

Ajax最大的优点是在不重新加载整个页面的情况下，可以与服务器交换数据并更新部分网页内容。


$.ajax({
    type: &quot;get&quot;, // get 请求方式，post另一种请求方式
    url: &quot;/Home/GetInfo&quot;, // url
    data: { &quot;dept&quot;: &quot;computer&quot;, &quot;name&quot;: &quot;.]]></description><category></category></item><item><title><![CDATA[wustoj2244数学]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/82185523</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/82185523</guid><author>codetypeman</author><pubDate>Wed, 29 Aug 2018 16:44:48 +0800</pubDate><description><![CDATA[Teleportation

Time Limit: 1 Sec  

Description

        Hovey just learnt a powerful skill from the failurc of his chasing MMs: teleportation. He can teleport from point (x , y) to another point (x',...]]></description><category></category></item><item><title><![CDATA[wustoj 1506 药丸 卡特兰数]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/82179445</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/82179445</guid><author>codetypeman</author><pubDate>Wed, 29 Aug 2018 10:42:41 +0800</pubDate><description><![CDATA[Description

一个药瓶里装有n颗药丸，每天吃半颗，需要在2n天吃完。每天吃药时，从药瓶中取药，如果取到的药是整颗的，就把它分成两半，吃掉其中的一半，另一半重新放入瓶中；如果取到的是半颗药，则直接吃掉。问共有多少种吃药方法？

例如：

n=1，则吃药方法有1种（取一颗，取半颗）。

n=2，则有2种吃药方法（取一颗，取半颗，取一颗，取半颗；取一颗，取一颗，取半颗，取半颗）。

Inpu...]]></description><category></category></item><item><title><![CDATA[Codeforces1027D捉老鼠 图论 dfs]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/82153970</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/82153970</guid><author>codetypeman</author><pubDate>Tue, 28 Aug 2018 20:32:35 +0800</pubDate><description><![CDATA[题目链接

D. Mouse Hunt

Medicine faculty of Berland State University has just finished their admission campaign. As usual, about 80%80% of applicants are girls and majority of them are going to live in t...]]></description><category></category></item><item><title><![CDATA[Codefoeces 1025C 思维+脑洞+坑]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/82118214</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/82118214</guid><author>codetypeman</author><pubDate>Mon, 27 Aug 2018 19:58:20 +0800</pubDate><description><![CDATA[                                               C. Plasticine zebra

Is there anything better than going to the zoo after a tiresome week at work? No wonder Grisha feels the same while spending the ent...]]></description><category></category></item><item><title><![CDATA[Codeforces 242 E XOR on Segment 异或线段树]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/82116354</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/82116354</guid><author>codetypeman</author><pubDate>Mon, 27 Aug 2018 19:27:47 +0800</pubDate><description><![CDATA[You've got an array a, consisting of n integers a1, a2, ..., an. You are allowed to perform two operations on this array:

Calculate the sum of current array elements on the segment [l, r], that is, c...]]></description><category></category></item><item><title><![CDATA[Maximal Intersection Codeforces  Round #506 Div. 3 贪心+暴力]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/82108998</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/82108998</guid><author>codetypeman</author><pubDate>Mon, 27 Aug 2018 10:58:20 +0800</pubDate><description><![CDATA[You are given nn segments on a number line; each endpoint of every segment has integer coordinates. Some segments can degenerate to points. Segments can intersect with each other, be nested in each ot...]]></description><category></category></item><item><title><![CDATA[高精度模板 WUSToj2238]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/82083181</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/82083181</guid><author>codetypeman</author><pubDate>Sun, 26 Aug 2018 18:56:26 +0800</pubDate><description><![CDATA[2238: Virus outbreak

Time Limit: 1 Sec  Memory Limit: 128 MB   

Description

        The State Veterinary Services Department recently reported an outbreak of a newly found cow disease. All cows fou...]]></description><category></category></item><item><title><![CDATA[hdu 5750 数论]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/81841318</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/81841318</guid><author>codetypeman</author><pubDate>Sun, 19 Aug 2018 20:25:28 +0800</pubDate><description><![CDATA[                                                   Dertouzos

A positive proper divisor is a positive divisor of a number nn, excluding nn itself. For example, 1, 2, and 3 are positive proper divisors...]]></description><category></category></item><item><title><![CDATA[二进制法枚举集合——权利指数 HDU1557]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/81612329</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/81612329</guid><author>codetypeman</author><pubDate>Sun, 12 Aug 2018 23:16:12 +0800</pubDate><description><![CDATA[                                                      权利指数

在选举问题中，总共有n个小团体，每个小团体拥有一定数量的选票数。如果其中m个小团体的票数和超过总票数的一半，则此组合为“获胜联盟”。n个团体可形成若干个获胜联盟。一个小团体要成为一个“关键加入者”的条件是：在其所在的获胜联盟中，如果缺少了这个小团体的加入，则此联盟不能成为获胜联盟...]]></description><category></category></item><item><title><![CDATA[母函数——秤砣问题——The Balance]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/81612214</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/81612214</guid><author>codetypeman</author><pubDate>Sun, 12 Aug 2018 22:48:59 +0800</pubDate><description><![CDATA[Now you are asked to measure a dose of medicine with a balance and a number of weights. Certainly it is not always achievable. So you should find out the qualities which cannot be measured from the ra...]]></description><category></category></item><item><title><![CDATA[单调栈求矩形块最大面积 poj 2082 两只黄鹂鸣翠柳,一行白鹭上青天]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/81559892</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/81559892</guid><author>codetypeman</author><pubDate>Fri, 10 Aug 2018 11:23:37 +0800</pubDate><description><![CDATA[                                              Terrible Sets

 Let N be the set of all natural numbers {0 , 1 , 2 , . . . }, and R be the set of all real numbers. wi, hi for i = 1 . . . n are some elem...]]></description><category></category></item><item><title><![CDATA[Bad Hair Day ——牛说我瞅你咋地——单调栈POJ3250]]></title><link>https://blog.youkuaiyun.com/codetypeman/article/details/81515201</link><guid>https://blog.youkuaiyun.com/codetypeman/article/details/81515201</guid><author>codetypeman</author><pubDate>Wed, 08 Aug 2018 20:56:08 +0800</pubDate><description><![CDATA[                                                   Bad Hair Day 

Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, F...]]></description><category></category></item></channel></rss>