- 博客(29)
- 资源 (116)
- 收藏
- 关注
原创 【LeetCode with Python】 Sort List
Sort a linked list in O(n log n) time using constant space complexity.
2014-07-26 14:17:25 15593
原创 【LeetCode with Python】 Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and [2,1,1].
2014-07-20 16:27:04 16168
原创 【LeetCode with Python】 Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?
2014-07-19 21:04:39 3974
原创 【LeetCode with Python】 Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \ / / / \ \ 3 2 1 1 3
2014-07-06 15:41:58 24661
原创 【LeetCode with Python】 Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your
2014-07-06 15:39:19 26938
原创 【LeetCode with Python】 Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example,Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.The above elevation map is represented by arra
2014-07-06 15:38:01 6870
原创 【LeetCode with Python】 Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the following is not: 1 / \ 2 2 \ \ 3 3Note:
2014-07-06 15:34:35 5795
原创 【LeetCode with Python】 Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the total sum of all root-to-leaf numbers.For example, 1 / \
2014-07-06 15:32:35 3008
原创 【LeetCode with Python】 Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A straight forward solution using O(mn) space is probably a bad idea.A simple improvement uses O(m
2014-07-06 15:30:50 6228
原创 【LeetCode with Python】 Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.
2014-07-06 15:26:46 6414
原创 【LeetCode with Python】 Reorder List
Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reorder it to {1,4,2,3}.
2014-07-06 15:24:34 2936
原创 【LeetCode with Python】 Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.
2014-07-06 15:21:09 4556 1
原创 【LeetCode with Python】 Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?
2014-07-06 15:17:49 3001
原创 【LeetCode with Python】 Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, note the restriction of using extra
2014-07-06 15:14:14 3525
原创 【LeetCode with Python】 Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4.Your algorithm should run in O(
2014-07-06 15:09:23 4557
原创 【LeetCode with Python】 Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
2014-07-06 15:07:26 2923
原创 【LeetCode with Python】 Letter Combinations of a Phone Number
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.Input:Digit string "23"Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "
2014-07-06 15:05:22 3847
原创 【LeetCode with Python】 Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.
2014-07-06 15:01:14 4159
原创 【LeetCode with Python】 Edit Distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:a) Insert a characterb) Delete a characterc) Replace a
2014-07-06 14:53:52 26626
原创 【LeetCode with Python】 Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, suc
2014-07-06 14:33:52 4507
原创 【LeetCode with Python】 Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
2014-07-06 14:28:22 3732
原创 【LeetCode with Python】 Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7return its bottom
2014-07-06 14:18:05 3927
原创 【LeetCode with Python】 Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7return its level order traversal as:[ [3]
2014-07-06 14:12:36 2590
原创 【LeetCode with Python】 Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5.Note:Given n will alway
2014-07-04 16:34:20 2044
原创 【LeetCode with Python】 Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note: You may only use constant extra space.For example,Given the following binary tree
2014-07-04 16:29:12 2012
原创 【LeetCode with Python】 Populating Next Right Pointers in Each Node
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set
2014-07-04 16:26:33 1944
原创 【LeetCode with Python】 Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.
2014-07-04 16:19:41 1985
原创 【LeetCode with Python】 Subsets II
Given a collection of integers that might contain duplicates, S, return all possible subsets.Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets.For example,If S = [1,2,2], a solutio
2014-07-04 16:11:45 2981
原创 【LeetCode with Python】 Subsets
Given a set of distinct integers, S, return all possible subsets.Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets.For example,If S = [1,2,3], a solution is:[ [3], [1], [2]
2014-07-04 16:04:01 2486
让你不再害怕指针
2015-01-25
转换指南:将程序从托管扩展C++迁移到C++/CLI
2015-01-25
数据结构C++语言描述 - William Ford - 清华大学出版社
2015-01-25
深度探索C++对象模型 - Stanley B.Lippman - 华中科技大学出版社
2015-01-25
编程精粹:Microsoft编写优质无错C程序秘诀 - Steve Maguire - 电子工业出版社
2015-01-25
STL源码剖析(简体中文清晰扫描带目录) - 侯捷 - 华中科技大学出版社
2015-01-25
C和C++代码精粹 - Bruce_Eckel - 人民邮电出版社
2015-01-25
C++语言的设计和演化 - Bjarne Stroustrup - 机械工业出版社
2015-01-24
C++面向对象多线程编程 - Cameron Hughes - 人民邮电出版社
2015-01-24
C++高级参考手册 - Clayton Walnum - 电子工业出版社
2015-01-24
C++编程思想 - Bruce Eckel - 机械工业出版社
2015-01-24
C++ Templates 简体中文版 David Vandevoorde 人民邮电出版社
2015-01-24
C++编程规范:101条准则、规则与最佳实践.Herb Sutter.人民邮电出版社
2015-01-24
软件工程:实践者的研究方法 第六版中文版 Roger S Pressman 机械工业出版社
2015-01-23
嵌入式计算系统设计原理 - Wayne Wolf - 机械工业出版社
2015-01-23
精通Qt4编程 - 蔡志明 - 电子工业出版社
2015-01-23
汇编语言 第2版 王爽 清华大学出版社
2015-01-23
编译原理 第二版中文版 Alfred V Aho 机械工业出版社
2015-01-23
The Science Of Programming - David Gries
2015-01-23
ZendStudio 12 0 1 linux gtk x86 64 part2 含破解工具 共两个压缩卷
2015-01-23
计算机程序的构造和解释(中文第二版) - Harold Abelson - 机械工专业出版社
2015-03-22
PHP高级程序设计:模式、框架与测试 - Kevin McArthur - 人民邮电出版社
2015-02-20
算法导论(第三版) 中文完整清晰版PDF 带书签
2015-02-01
深入理解MySQL核心技术 中文版 Sasba Pachev 中国电力出版社
2015-01-25
SQL编程风格 - Joe Celko - 人民邮电出版社
2015-01-25
MySQL网络数据库指南 - Paul DuBois - 机械工业出版社
2015-01-25
MySQL核心内幕 - 祝定泽 - 清华大学出版社
2015-01-25
MySQL核心技术手册 第二版中文版 Russell J T Dyer 机械工业出版社
2015-01-25
鸟哥的Linux私房菜服务器架设篇(第三版) - 鸟哥 - 机械工业出版社
2015-01-25
Linux内核设计与实现(第三版中文版) - Robert Love - 机械工业出版社
2015-01-25
Bash Beginners Guide(中文版) - Machtelt Garrels
2015-01-25
TCP/IP详解(卷1,卷2,卷3) - W.Richard Stevens - 机械工业出版社
2015-01-25
推荐系统实践(高清版).项亮.人民邮电出版社
2015-01-23
设计模式:基于C#的工程化实现及扩展.王翔.电子工业出版社
2015-01-23
图像处理 分析与机器视觉 第三版中文版 Milan Sonka 人民邮电出版社
2015-01-23
推荐系统实践(高清版) - 项亮 - 人民邮电出版社
2015-01-23
设计模式:基于C#的工程化实现及扩展 - 王翔 - 电子工业出版社
2015-01-23
软件工程:实践者的研究方法 第七版中文版 Roger S Pressman 机械工业出版社
2015-01-23
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人