![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
python
文章平均质量分 63
Coder_Aichemist
DataMining;Product Manager;Pythoner
展开
-
Eclipse和PyDev搭建完美Python开发环境
Eclipse和PyDev搭建完美Python开发环境原创 2016-12-05 17:03:01 · 2512 阅读 · 0 评论 -
算法分析与设计课程(13):【leetcode】 Product of Array Except Self
Description:Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without d原创 2017-05-19 14:16:55 · 264 阅读 · 0 评论 -
算法分析与设计课程(14):【leetcode】 Maximal Square
Description:Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.For example, given the following matrix:1 0 1 0 01 0 1 1 11原创 2017-05-25 15:20:45 · 237 阅读 · 0 评论 -
算法分析与设计课程(9):【leetcode】Jump Game
Description:Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position原创 2017-04-23 19:55:00 · 229 阅读 · 0 评论 -
算法分析与设计课程(11):【leetcode】Gray Code
Description:The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, prin原创 2017-05-04 15:54:44 · 289 阅读 · 0 评论 -
算法分析与设计课程(10):【leetcode】Simplify Path
Description:Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.算法分析:原创 2017-04-30 16:23:46 · 216 阅读 · 0 评论 -
算法分析与设计课程(8):【leetcode】Sudoku Solver
Description:Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.原创 2017-04-14 09:15:49 · 285 阅读 · 0 评论 -
算法分析与设计课程(5):【leetcode】Search for a Range
Description:Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(原创 2017-03-26 12:03:44 · 235 阅读 · 0 评论 -
算法分析与设计课程(6):【leetcode】Sudoku
Description:The Sudoku board could be partially filled, where empty cells are filled with the character'.'.A partially filled sudoku which is valid.Note:A valid Sudoku board (partially原创 2017-03-30 11:18:41 · 280 阅读 · 0 评论 -
算法分析与设计课程(7):【leetcode】Reverse Nodes in k-Group
Description:Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less than or equal to the length of the linked lis原创 2017-04-07 14:57:33 · 261 阅读 · 0 评论 -
算法分析与设计课程(3):【leetcode】Permutations
PermutationsDescription:Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:算法分析:解决这个问题,很容易想到树,一层层地生成。原创 2017-03-09 18:20:23 · 219 阅读 · 0 评论 -
算法分析与设计课程(4):【leetcode】Wildcard Matching
Description:Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The match原创 2017-03-17 15:44:27 · 243 阅读 · 0 评论 -
算法分析与设计课程(2):Letter Combinations of a Phone Number
Description:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Inpu原创 2017-03-03 15:41:55 · 204 阅读 · 0 评论 -
算法分析与设计课程(15):【leetcode】 Find Minimum in Rotated Sorted Array
Description:Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.原创 2017-06-05 15:57:08 · 204 阅读 · 0 评论