原创 Lintcode 159. Find Minimum in Rotated Sorted Array (Medium) (Python)

Find Minimum in Rotated Sorted Array Description: Suppose a sorted array is rotated at some pivot unknown to you befo

2018-09-17 02:24:13 1

原创 Lintcode 886. Convex Polygon (Medium) (Python)

Convex Polygon Description: Given a list of points that form a polygon when joined sequentially, find if this polygon

2018-09-17 02:24:13 4

原创 Lintcode 544. Top k Largest Numbers (Medium) (Python)

Top k Largest Numbers Description: Given an integer array, find the top k largest numbers in it. Example Given [3,10

2018-09-17 02:24:13 13

原创 Lintcode 904. Plus One Linked List (Medium) (Python)

Plus One Linked List Description: Given a non-negative integer represented as non-empty a singly linked list of digit

2018-09-17 02:24:13 1

原创 Lintcode 545. Top k Largest Numbers II (Medium) (Python)

Top k Largest Numbers II Description: Implement a data structure, provide two interfaces: add(number). Add a new numb

2018-09-17 02:24:13 1

原创 Lintcode 383. Container With Most Water (Medium) (Python)

Container With Most Water Description: Given n non-negative integers a1, a2, …, an, where each represents a point at

2018-09-17 02:24:13 2

原创 Lintcode 1259. Integer Replacement (Medium) (Python)

Integer Replacement Description: Given a positive integer n and you can do operations as follow: 1.If n is even, repl

2018-09-13 05:55:12 1

原创 Lintcode 1195. Find Largest Value in Each Tree Row (Medium) (Python)

Find Largest Value in Each Tree Row Description: You need to find the largest value in each row of a binary tree. Exa

2018-09-13 05:55:12 1

原创 Lintcode 617. Maximum Average Subarray II (Medium) (Python)

Maximum Average Subarray II Description: Given an array with positive and negative numbers, find the maximum average

2018-09-13 05:55:12

原创 Lintcode 148. Sort Colors (Medium) (Python)

Sort Colors Description: Given an array with n objects colored red, white or blue, sort them so that objects of the s

2018-09-13 05:55:12 1

原创 Lintcode 418. Integer to Roman (Medium) (Python)

Integer to Roman Description: Given an integer, convert it to a roman numeral. The number is guaranteed to be within

2018-09-13 05:55:12 1

原创 Lintcode 178. Graph Valid Tree (Medium) (Python)

Graph Valid Tree Description: Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pa

2018-09-13 05:55:12 3

原创 Lintcode 388. Permutation Sequence (Medium) (Python)

Permutation Sequence Description: Given n and k, return the k-th permutation sequence. Example For n = 3, all permut

2018-09-13 05:55:12 1

原创 Lintcode 15. Permutations (Medium) (Python)

Permutations Description: Given a list of numbers, return all possible permutations. Example For nums = [1,2,3], the

2018-09-13 05:55:12

原创 Lintcode 16. Permutations II (Medium) (Python)

Permutations II Description: Given a list of numbers with duplicate number in it. Find all unique permutations. Examp

2018-09-13 05:55:12