ericshijian的博客

Leetcode练习： Subset 题目： Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not conta

题目：  Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 分析： 没有太多可说的，easy难度的一道题目，使用暴力搜索的方法即可通过 。 当然也可以采用更高级的算法，比如K

you must use a new ndarray to store the transferred elements, as described in the documents: By default, astype always returns a newly allocated array. If thisis set to false, and the dtype,