taoqick的专栏

【代码】Pytorch查看GPU是否可用。

抽象基类提供了逻辑和实现解耦的能力，即在不同的模块中通过抽象基类来调用，可以用最精简的方式展示出代码之间的逻辑关系，让模块之间的依赖清晰简单。同时，一个抽象类可以有多个实现，让系统的运转更加灵活。极简版的抽象类实现，也让代码可读性更高。将其他的类”注册“到抽象基类下当虚拟子类（调用register方法），虚拟子类的好处是你实现的第三方子类不需要直接继承自基类，可以实现抽象基类中的部分API接口，也可以根本不实现，但是issubclass(), issubinstance()进行判断时仍然返回真值。

史遗留问题.2.2以前的时候type和object还不统一. 在2.2统一以后到3之间, 要用class Foo(object)来申明新式类, 因为他的type是 < type 'type' > .不然的话, 生成的类的type就是 < type 'classobj' >

【代码】[Debug] vscode debug with parameters。简单来说就是配置下launch.json：

前提是在pycharm中执行没问题，解决方法是在pycharm中设置一下：file——setting——project：xxx——project structure——选中.py模块所在路径然后点击“source”——ok 红色波浪线就可以消除！！

简单来说就是防止多继承的时候多次调用基类的构造函数！super() 的入门使用在类的继承中，如果重定义某个方法，该方法会覆盖父类的同名方法，但有时，我们希望能同时实现父类的功能，这时，我们就需要调用父类的方法了。调用父类同名方法有两种方式：1、调用未绑定的父类方法2、使用super函数来调用先来说下第一种方式：调用未绑定的父类方法。演示：class Base(object): def greet(self): print('hi,I am Base')cl

在PyTorch中进行二分类，有三种主要的全连接层，激活函数和loss function组合的方法，分别是：torch.nn.Linear+torch.sigmoid+torch.nn.BCELoss，torch.nn.Linear+BCEWithLogitsLoss，和torch.nn.Linear（输出维度为2）+torch.nn.CrossEntropyLoss，BCEWithLogitsLoss集成了Sigmoid，但是CrossEntropyLoss集成了Softmax。-----------

如题import time, functoolsdef log(func): @functools.wraps(func) def wrapper(*args, **kw): # 因为返回的那个wrapper() # 函数名字就是'wrapper'，所以，需要把原始函数的__name__等属性复制到wrapper() # 函数中，否则，有些依赖函数签名的代码执行就会出错。 # 不需要编写wrapper.__name__

Python函数参数(Python Function Arguments)Python allows us to define three types of arguments for a function:Python允许我们为函数定义三种类型的参数：Formal Arguments, for exampledef add(a, b) 形式参数，例如def add(a, b) Variable number of non-keyworded arguments using *args,..

Given an arraynumswithnintegers, your task is to check if it could become non-decreasing by modifyingat most one element.We define an array is non-decreasing ifnums[i] <= nums[i + 1]holds for everyi(0-based) such that (0 <= i <= n - 2)....

Given a binary treerootand an integertarget, delete all theleaf nodeswith valuetarget.Notethat once you delete a leaf node with valuetarget,if it's parent node becomes a leaf node and has the valuetarget, it should also be deleted (you need to ...

On a 2D plane, we placenstones at some integer coordinate points. Each coordinate point may have at most one stone.A stone can be removed if it shares eitherthe same row or the same columnas another stone that has not been removed.Given an arraysto...

前言：博主在刚接触Python的时候时常听到GIL这个词，并且发现这个词经常和Python无法高效的实现多线程划上等号。本着不光要知其然，还要知其所以然的研究态度，博主搜集了各方面的资料，花了一周内几个小时的闲暇时间深入理解了下GIL，并归纳成此文，也希望读者能通过次本文更好且客观的理解GIL。文章欢迎转载，但转载时请保留本段文字，并置于文章的顶部 作者：卢钧轶(cenalulu) 本文原文地址：http://cenalulu.github.io/python/gil-in-python/...

On a 2-dimensionalgrid, there are 4 types of squares:1represents the starting square. There is exactly one starting square. 2represents the ending square. There is exactly one ending square. 0represents empty squares we can walk over. -1represe...

Given a C++ program, remove comments from it. The programsourceis an array wheresource[i]is thei-th line of the source code. This represents the result of splitting the original source code string by the newline character\n.In C++, there are two ty...

题目如标题，很容易想到劈成两半，每一半各求最近的，最后merge难点在f(n)如何估计，假设两个子问题的点集分别是left和right，两部分的最近距离分别是d1和d2，所以有可能的最小距离δ=min(d1,d2)。如果left中的每一个点都要和right中的每一个点求距离，那么f(n)=n^2，分治算法是不会简化的。幸运的是如果left中的每一个点最多只需要和right中的最多6个点比较【使用下图中的鸽巢原理证明】所以还有T(n)=O(nlog(n))，代码如下：import ran

Given a stringsthat consists of only uppercase English letters, you can perform at mostkoperations on that string.In one operation, you can chooseanycharacter of the string and change it to any other uppercase English character.Find the length of...

在“偏好设置”->“编辑器”->“常规”->“智能键”->“粘贴时重新格式化”下，将其设置为“无”。 在Editor->Code Style->Python里，把各种对勾打拿掉

Implement theStreamCheckerclass as follows:StreamChecker(words): Constructor, init the data structure with the given words. query(letter): returns true if and only if for somek >= 1, the lastkcharacters queried (in order from oldest to newest, i...

python 中的for 循环和while 循环的效率比较低。如果遇到循环时，尽量使用map() reduce() filter()。这三个函数的运行速度比较快：map()函数他接收一个函数和一个序列。在python3 中返回一个map对象。在python2 中返回一个列表：b=map(lambda x:print("中秋快乐%s"%x),[1,2,3])b3 = map(lambda x:x*2,range(10)) #相当于 [ i*2 for i in range(10)]print(ls

You are given an n x n grid representing a field of cherries, each cell is one of three possible integers.0 means the cell is empty, so you can pass through,1 means the cell contains a cherry that you can pick up and pass through, or-1 means the cell co

如下import jsonclass Trie: def __init__(self, a, b): self.a,self.b = a,brt = Trie(2,3)attrs = vars(rt)print(', '.join("%s: %s" % item for item in attrs.items()))

Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.Examples:[2,3,4], the median is3[2,3], the median is(2 + 3) / 2 = 2.5Given an arr...

A car travels from a starting position to a destination which istargetmiles east of the starting position.Along the way, there are gas stations. Eachstation[i]represents a gas station that isstation[i][0]miles east of the starting position, and ha...

The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially positioned in the top-left room and must fight his way thro

Given an arrayAof non-negative integers, return the maximum sum of elements in two non-overlapping (contiguous) subarrays, which have lengthsLandM. (For clarification, theL-length subarray could occur before or after theM-length subarray.)Formall...

There is a one-dimensional garden on the x-axis. The garden starts at the point0and ends at the pointn. (i.e The length of the garden isn).There aren + 1taps locatedat points[0, 1, ..., n]in the garden.Given an integernand an integer arrayra...

Your friend is typing hisnameinto a keyboard. Sometimes, when typing a characterc, the key might getlong pressed, and the character will be typed 1 or more times.You examine thetypedcharacters of the keyboard. ReturnTrueif it is possible that i...

Given a strings, akduplicate removalconsists of choosingkadjacent and equal letters fromsand removingthem causing the left and the right side of the deleted substring to concatenate together.We repeatedly makekduplicate removals onsuntil we ...

Given a stringS, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same.If possible, output any possible result. If not possible, return the empty string.Example 1:Input: S = "aab"Output: "a..

Given therootof a binary tree, return allduplicate subtrees.For each kind of duplicate subtrees, you only need to return the root node of anyoneof them.Two trees areduplicateif they have thesame structurewith thesame node values.Example ...

Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.According to thedefinition of h-index on Wikipedia: "A scientist has indexhifhof his/herNpapers haveat lea...

Given am * nmatrix of ones and zeros, return how manysquaresubmatrices have all ones.Example 1:Input: matrix =[ [0,1,1,1], [1,1,1,1], [0,1,1,1]]Output: 15Explanation: There are 10 squares of side 1.There are 4 squares of side 2.The...

In a N x Ngridcomposed of 1 x 1 squares, each 1 x 1 square consists of a/,\, or blank space. These characters divide the square into contiguous regions.(Note that backslash characters are escaped, so a\is represented as"\\".)Return the number o...

Given twostringsSandT,return if they are equal when both are typed into empty text editors.#means a backspace character.Note that afterbackspacing an empty text, the text will continue empty.Example 1:Input: S = "ab#c", T = "ad#c"Output: tr...

简单来说，Python运行时的包会去sys.path找，而sys.path这个数组会从前到后找，优先级以此是：文件本身的路径 系统环境变量PYTHONPATH的路径 系统环境变量PATH里指定的anaconda的安装路径可以用以下脚本进行一下测试：import osimport sysprint("os.environ['PYTHONPATH']={0}".format(os.environ['PYTHONPATH']))print("os.environ['PATH']={0}".f

You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and height of the other envelope.What is the m

Given string S and adictionary of words words, find the number of words[i] that is a subsequence of S.Example :Input: S = "abcde"words = ["a", "bb", "acd", "ace"]Output: 3Explanation: There are three words in words that are a subsequence ofS : "..

There are N network nodes, labelled 1 to N.Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v is the target node, and w is the time it takes for a signal to travel from source to target.Now, we sen

We have a grid of 1s and 0s; the 1s in a cell represent bricks. A brick will not drop if and only if it is directly connected to the top of the grid, or at least one of its (4-way) adjacent bricks will not drop.We will do some erasuressequentially. Eac..