leetcode
PCChris95
这个作者很懒,什么都没留下…
展开
-
leetcode刷题之链表
q86 Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each ...原创 2019-02-15 23:00:07 · 159 阅读 · 0 评论 -
leetcode刷题之递归,回溯和分治
78. 子集 给定一组不含重复元素的整数数组nums,返回该数组所有可能的子集(幂集)。 说明:解集不能包含重复的子集。 示例: 输入: nums = [1,2,3] 输出: [ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ] python解答: 思路一:利用递归和回溯的思想。 ...原创 2019-03-15 11:18:20 · 388 阅读 · 0 评论 -
leetcode刷题之二分查找
python实现简单二分查找: def binary_search(stack, val): begin = 0 end = len(stack) while 1: mid = int(( begin + end ) / 2) if stack[mid] == val: return mid el...原创 2019-03-09 21:16:06 · 150 阅读 · 0 评论 -
leetcode刷题之动态规划
300. Longest Increasing Subsequence Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation: The longest ...原创 2019-03-09 19:21:50 · 137 阅读 · 0 评论 -
leetcode刷题之排序算法python实现
快速排序算法: def quick_sort(nums, first, last): if first > last: return mid_val = nums[first] high = last low = first while low < high: while low < high a原创 2019-03-08 14:05:20 · 670 阅读 · 0 评论 -
leetcode刷题之字符串处理
3. Longest Substring Without Repeating Characters Given a string, find the length of the longest substring without repeating characters. Example 1: Input: “abcabcbb” Output: 3 Explanation: The answer...原创 2019-02-21 13:00:22 · 278 阅读 · 0 评论 -
leetcode刷题之二叉树
113. Path Sum II Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. Note: A leaf is a node with no children. Example: Given the below binary tree a...原创 2019-03-05 14:36:37 · 133 阅读 · 0 评论 -
leetcode刷题之贪心算法
贪心算法: 在对问题求解时,总是做出在当前看来是最好的选择。也就是说,不从整体最优上加以考虑,他所做出的是在某种意义上的局部最优解。 455. Assign Cookies Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at...原创 2019-02-19 20:56:08 · 478 阅读 · 0 评论 -
leetcode刷题之栈和队列
225. Implement Stack using Queues Implement the following operations of a stack using queues. push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the top...原创 2019-02-17 09:55:28 · 195 阅读 · 0 评论