<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[forever_zzx的专栏]]></title><description><![CDATA[新手成长之路，一切从这里开始]]></description><link>https://blog.youkuaiyun.com/forever_zzx</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; forever_zzx]]></copyright><item><title><![CDATA[pandas学习记录]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/115920090</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/115920090</guid><author>forever_zzx</author><pubDate>Tue, 20 Apr 2021 23:59:36 +0800</pubDate><description><![CDATA[目录




前言

二、使用步骤

1. pandas数据结构

1.1 Series

1.2 DataFrame

2. 使用方法

2.1 创建对象

2.2 查看数据

总结





前言

提示：这里可以添加本文要记录的大概内容：
例如：随着人工智能的不断发展，机器学习这门技术也越来越重要，很多人都开启了学习机器学习，本文就介绍了机器学习的基础内容。

一、pandas是什么？

Pandas是一个强大的分析结构化数据的工具集；它的使用基础是Numpy（提供高性能的矩阵运算）；

用于数据..]]></description><category></category></item><item><title><![CDATA[Jupyter 添加Conda环境]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/113974332</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/113974332</guid><author>forever_zzx</author><pubDate>Tue, 23 Feb 2021 10:21:33 +0800</pubDate><description><![CDATA[进入某个环境，安装相关包
安装ipykernel

conda install -c anaconda ipykernel


将环境添加到jupyter lab中

python -m ipykernel install --user --name=myEnv

启动jupyter， 在.ipynb文件中就能看到添加的环境

]]></description><category></category></item><item><title><![CDATA[搭建cuda环境]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/113729164</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/113729164</guid><author>forever_zzx</author><pubDate>Sat, 06 Feb 2021 19:45:44 +0800</pubDate><description><![CDATA[1 安装驱动

1.1 前期工作

1.1.1 禁用nouveau

ubuntu 16.04默认安装了第三方开源的驱动程序nouveau，安装nvidia显卡驱动首先需要禁用nouveau，不然会碰到冲突的问题，导致无法安装nvidia显卡驱动。指令如下

sudo gedit/etc/modprobe.d/blacklist.conf 打开文件，在最后添加如下两行：

blacklist nouveau

options nouveau modeset=0

1.1.2 更新系统修改

sudo u..]]></description><category></category></item><item><title><![CDATA[pytorch安装及faster-rcnn.pytorch使用记录]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/109046476</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/109046476</guid><author>forever_zzx</author><pubDate>Tue, 13 Oct 2020 11:21:45 +0800</pubDate><description><![CDATA[目前所处的办公环境限制较多，对搭建开发环境造成较大阻碍，在安装pytorch时, pip和conda库不能及时更新，很多时候需要手动安装。在这样的背景下，本文记录pytorch和faster-rcnn.pytorch 的在使用过程中的问题。
1. pytorch的安装
pytorch的安装首先需要确定安装的版本，其次要明确当前cuda的版本，最后还要知道所使用的python版本。一般来讲，如果使用官方库安装，安装的pytorch应该是在对应版本的cuda下编译的，但是由于本人所处的环境，pip和conda库]]></description><category></category></item><item><title><![CDATA[torchvision transform巨坑]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/108200135</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/108200135</guid><author>forever_zzx</author><pubDate>Mon, 24 Aug 2020 15:28:39 +0800</pubDate><description><![CDATA[最近用到torchvision.transform.Normalize，发现不同版本对输入的改变不同，下面对比torchvision 0.2.1和0.4.2版本
0.2.1：
def normalize(tensor, mean, std):
    """Normalize a tensor image with mean and standard deviation.
    See ``Normalize`` for more details.
    Args:
        tensor (Te]]></description><category></category></item><item><title><![CDATA[mmcv 安装记录]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/107428808</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/107428808</guid><author>forever_zzx</author><pubDate>Sat, 18 Jul 2020 14:55:55 +0800</pubDate><description><![CDATA[安装mmcv，我选择的是源码安装，按照官方给出的步骤，运行命令

MMCV_WITH_OPS=1 pip install -e .

出现错误提示，如下：

distutils.errors.DistutilsError: Could not find suitable distribution for Requirement.parse(‘pytest-runner’)

于是安装pytest-runner:

pip install pytest-runner

随后再次运行安装命令，仍然出现错误，于是]]></description><category></category></item><item><title><![CDATA[LeetCode124 最大路径和]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/102643814</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/102643814</guid><author>forever_zzx</author><pubDate>Sat, 19 Oct 2019 22:13:24 +0800</pubDate><description><![CDATA[给定一个非空二叉树，返回其最大路径和。

本题中，路径被定义为一条从树中任意节点出发，达到任意节点的序列。该路径至少包含一个节点，且不一定经过根节点。

示例 1:

输入: [1,2,3]

   1
   / \
  2  3

输出: 6
示例2:

输入: [-10,9,20,null,null,15,7]

 -10
/ \
9 20
/ ...]]></description><category></category></item><item><title><![CDATA[开放问题]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/95007188</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/95007188</guid><author>forever_zzx</author><pubDate>Sun, 07 Jul 2019 17:23:21 +0800</pubDate><description><![CDATA[top k问题
一般采用hash统计频率，再来使用堆排序，如果有内存大小限制，则采用分堆的思想，对数字使用比特位，对字符使用hash值除以一个值来分堆，这样相同的元素都在一个堆里面。


...]]></description><category></category></item><item><title><![CDATA[字符串排列相关]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/89568348</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/89568348</guid><author>forever_zzx</author><pubDate>Fri, 26 Apr 2019 17:46:48 +0800</pubDate><description><![CDATA[All possible permutations of a string

def permutation(prefix, s):
    if len(s) == 0:
        print(prefix)
    else:
        visit = set()
        for i in range(len(s)):
            if s[i] in vis...]]></description><category></category></item><item><title><![CDATA[有序数组的交集和并集]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/89556364</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/89556364</guid><author>forever_zzx</author><pubDate>Fri, 26 Apr 2019 16:58:13 +0800</pubDate><description><![CDATA[define two indexs starting from 0 for the arrays. Compare values the two indexs referring to, and move the indexs under each condition.

The union of two sorted arrays

def union(list1, list2):
    l1...]]></description><category></category></item><item><title><![CDATA[随机数、概率题]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/88807689</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/88807689</guid><author>forever_zzx</author><pubDate>Mon, 25 Mar 2019 22:10:27 +0800</pubDate><description><![CDATA[由rand5 (0-4)生成rand7 (0-6)
res = 5*rand5 + rand5，这样生成0-24之间的数，能够保证每个数的概率相同，取0-20之间的数，舍弃后面的，然后输出res%7即为rand7的效果
扩展：由randA (0-a)生成randB (0-b)
若a&gt;b，直接返回0-b之间的数即可；
若a&lt;b，res=(a+1)*randA+randA，若res仍小于...]]></description><category></category></item><item><title><![CDATA[修桌子]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/88791497</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/88791497</guid><author>forever_zzx</author><pubDate>Mon, 25 Mar 2019 13:25:23 +0800</pubDate><description><![CDATA[Arthur最近搬到了新的别墅，别墅特别大，原先的桌子显得比较小，所以他决定换一张新的桌子。他买了一张特
别大的桌子，桌子是由很多条桌腿进行支撑的，可是回到家之后他发现桌子不稳，原来是桌子腿长度不太相同。他
想要自己把桌子修理好，所以他决定移除掉一些桌腿来让桌子变得平稳。桌子腿总共有n条腿，第i条腿长度为li，
Arthur移除第i桌腿要花费代价为di。假设k条腿桌子平稳的条件:超过一半桌腿能够达...]]></description><category></category></item><item><title><![CDATA[LeetCode 290: Word Pattern]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/88579003</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/88579003</guid><author>forever_zzx</author><pubDate>Fri, 15 Mar 2019 17:17:22 +0800</pubDate><description><![CDATA[Given a pattern and a string str, find if str follows the same pattern.
Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.
Example ...]]></description><category></category></item><item><title><![CDATA[LeetCode 213: House Robber II]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/88377398</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/88377398</guid><author>forever_zzx</author><pubDate>Sun, 10 Mar 2019 13:25:31 +0800</pubDate><description><![CDATA[You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is ...]]></description><category></category></item><item><title><![CDATA[LeetCode 198: House Robber]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/88377376</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/88377376</guid><author>forever_zzx</author><pubDate>Sun, 10 Mar 2019 13:23:38 +0800</pubDate><description><![CDATA[You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house...]]></description><category></category></item><item><title><![CDATA[LeetCode 69: Sqrt(x)]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/88260508</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/88260508</guid><author>forever_zzx</author><pubDate>Wed, 06 Mar 2019 22:23:47 +0800</pubDate><description><![CDATA[Implement int sqrt(int x).
Compute and return the square root of x, where x is guaranteed to be a non-negative integer.
Since the return type is an integer, the decimal digits are truncated and only t...]]></description><category></category></item><item><title><![CDATA[LeetCode 229: Majority Element II]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/88047340</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/88047340</guid><author>forever_zzx</author><pubDate>Thu, 28 Feb 2019 23:23:15 +0800</pubDate><description><![CDATA[Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Note: The algorithm should run in linear time and in O(1) space.
Example 1:
Input: [3,2,3]
Output: [3]

Example...]]></description><category></category></item><item><title><![CDATA[LeetCode 169: Majority Element]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/88047139</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/88047139</guid><author>forever_zzx</author><pubDate>Thu, 28 Feb 2019 23:10:12 +0800</pubDate><description><![CDATA[Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element alway...]]></description><category></category></item><item><title><![CDATA[LeetCode 191: Number of 1 Bits]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/87998877</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/87998877</guid><author>forever_zzx</author><pubDate>Thu, 28 Feb 2019 00:12:51 +0800</pubDate><description><![CDATA[n &amp;amp; (n-1) can remove the last zero 1 in binary format.
class Solution(object):
    def hammingWeight(self, n):
        &quot;&quot;&quot;
        :type n: int
        :rtype: int
        &quot;&quot;&quot;
        res = 0
    ...]]></description><category></category></item><item><title><![CDATA[LeetCode 101: Symmetric Tree]]></title><link>https://blog.youkuaiyun.com/forever_zzx/article/details/87997550</link><guid>https://blog.youkuaiyun.com/forever_zzx/article/details/87997550</guid><author>forever_zzx</author><pubDate>Wed, 27 Feb 2019 23:30:23 +0800</pubDate><description><![CDATA[Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
    1
   / \
  2   2
 / \ / \
3  4 4  3

But ...]]></description><category></category></item></channel></rss>