二分查找
帘外雨
学生一枚
展开
-
Leetcode 410. Split Array Largest Sum
问题描述: Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum amon原创 2017-06-28 22:09:12 · 181 阅读 · 0 评论 -
Leetcode 354. Russian Doll Envelopes
问题描述 You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both the width and height of one envelope is gre原创 2017-06-30 17:09:26 · 316 阅读 · 0 评论 -
Leetcode:611. Valid Triangle Number
Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.Example 1: In原创 2017-09-04 21:38:09 · 215 阅读 · 0 评论