weixin_41515197的博客

原创 mac anaconda+tensorflow安装（2021）

安装anacondaanaconda下载地址看教程的时候发现有人说直接下很慢，我是用迅雷下的还是很快下完了。安装过程一直确定即可。安装tensorflow输入conda --version可以看到版本信息。然后创建tensorflow环境，输入（但是现在先别执行下面的命令）：conda create --name tensorflow python=3.7当然也可以选其他版本的python。但是在此之前，需要修改一下镜像，不然多半会在中途因为网络导致安装失败。因为我看别人更换镜像的

原创 安装Homebrew很慢，解决办法

正常安装速度过慢/bin/bash -c "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/HEAD/install.sh)"之前，在命令行里输入这行命令就完全可以安好，但是今天重装系统后，在安homebrew速度慢到不行，科学上网也只有几k的速度，实在太慢了，而且安完了过后我看了下homebrew那个文件夹的大小超过1G了，真要按几k的速度来，那得装多久。方法网上很多的博文都提供了一种方法，就是修改镜像，任意一篇都是

原创 PAT A1049-Counting Ones

PAT A1049-Counting Ones题目The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. For example, given N bei...

原创 PAT A1045-Favorite Color Stripe

#PAT A1045-Favorite Color Stripe题目Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off those unwanted p...

原创 PAT 1040-Longest Symmetric String

PAT A1040-Longest Symmetric String题目Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given Is PAT&TAP symmetric?, the longest symmetric sub...

原创 SF与OF关系判断两带符号数大小

原创 关于标志信息ZF、OF、SF、CF的理解

带标志加法器结构零标志ZF零标志是根据每一位加法器的计算结果FiF_iFi​相或得到的，所以只有在结果的每一位都为0的时候所有位相或才能得到0的输出，但是或门上有取反符号，所以在ZF标志的输出为1时代表结果全零，反之不全为0.溢出标志OF注意OF是判断带符号数是否溢出的，对于无符号数OF不能用作溢出的判断，因为如果两个高位为0的数相加，得到的结果高位为1，明显对于无符号数这种情况是可以......

原创 布斯乘法以及带符号数的运算

#布斯乘法以及带符号数的运算正在准备考研复习，今天在看袁春风老师的计算机系统基础的时候讲到了布斯算法，于是去了解了一下，百度百科中的布斯算法部分还是讲得挺清楚的。下面是我的一些理解，如有错误欢迎指出。乘法理解对于最熟悉的十进制乘法很最基本的运算原理就是一个乘数乘以另一个乘数的个位、十位、百位···数字然后求和。比如==123×456=123×6+123×5×10+123×4×102123\t...

原创 PAT A1033-To Fill or Not to Fill

PAT A1033-To Fill or Not to Fill题目With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the...

原创 PAT A1031-Hello World for U

#PAT A1031-Hello World for U题目Given any string of N (≥5) characters, you are asked to form the characters into the shape of U. For example, helloworld can be printed as:h de ll rlowoThat is...

原创 PAT A1026-Table Tennis

PAT A1026-Table Tennis题目A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they w...

原创 PAT 1016-Phone Bills

PAT 1016-Phone Bills题目A long-distance telephone company charges its customers by the following rules:Making a long-distance call costs a certain amount per minute, depending on the time of day when...

原创 PAT A1014-Waiting in Line

PAT A1014-Waiting in Line题目Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to...

原创 PAT A1013-Battle Over Cities

PAT A1013-Battle Over Cities题目It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We...

原创 PAT A1009-Product of Polynomials

PAT A1009-Product of Polynomials题目This time, you are supposed to find A×B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, ...

原创 PAT A1007-Maximum Subsequence Sum

PAT A1007-Maximum Subsequence Sum题目Given a sequence of K integers { N1, N2, …, N**K }. A continuous subsequence is defined to be { N**i, N**i+1, …, N**j } where 1≤i≤j≤K. The Maximum Subsequence is t...

原创 PAT A1004-Counting Leaves

PAT A1004-Counting Leaves题目A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one ...

原创 PAT A1017-Queueing at Bank

PAT A1017-Queueing at Bank题目Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wai...

原创 PAT A1030-Travel Plan（Dijkstra）

PAT A1030-Travel Plan（Dijkstra）题目A traveler’s map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a tra...

原创 PAT-A1021 Deepest Root

PAT-A1021 Deepest Root题目A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a ...

原创 PAT A1053-Path of Equal Weight（DFS）

PAT A1053-Path of Equal Weight（DFS）题目Given a non-empty tree with root R, and with weight WiW_iWi​ assigned to each tree node TiT_iTi​. The weight of a path from R to L is defined to be the sum of th...

原创 PAT A1052-Linked List Sorting（链表）

PAT A1052-Linked List Sorting（链表）题目A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next po...

原创 PAT A1032-Sharing（链表）

PAT A1032-Sharing（链表）题目To store English words, one method is to use linked lists and store a word letter by letter. To save some space, we may let the words share the same sublist if they share the ...

原创 PAT A1093-Count PAT's

PAT A1093-Count PAT’s题目The string APPAPT contains two PAT's as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and ...

原创 PAT A1010-Radix（二分法）

PAT A1010-Radix（二分法）题干Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal number and 110 is a binary number.Now for an...

原创 《统计学习方法》感知机——读书笔记

《统计学习方法》感知机——读书笔记本文是在对李航老师《统计学习方法》第二章感知机，学习后的读书笔记与个人的一些理解，内容如果有错，欢迎大家指正，我们一起进步：）感知机模型输入空间X\mathcal{X}X，输出空间Y={−1,+1}\mathcal{Y}=\{-1,+1\}Y={−1,+1}，x∈X,y∈Yx\in\mathcal{X},y\in\mathcal{Y}x∈X,y∈Y，w为权值...