LeetCode Brush title Summary - binary search and greedy articles

This article describes the problems related to binary search algorithm and greedy law on LeetCode, the total number of questions for the recommended brush 16. Specific test sites are summarized below:

 

 

First, the binary search

1. mathematical problems

Question: 29 dividing the two medium difficulty

Question: 668 multiplication table in a small number of k, Difficulty

Question: After the factorial function 793 K zero, Difficulty

 

2. The actual scene problems

Question: 174 Dungeon game on the Hard difficulty

Question: 911 Online Election, medium difficulty.

 

3. Array problem

Question: 300 rises longest sequence, medium difficulty

Question: rectangular area does not exceed 363 K and the maximum value, Difficulty

 

4. Special define the problem

Question: 352 rheological data for multiple disjoint intervals Difficulty

Question: 436 Looking for the right range, medium difficulty

 

Second, the greedy method

1. The actual scene problems

Question: 134 gas stations, medium difficulty

Question: 135 distribute candy, Difficulty

Question:. 649 Dota2 Senate, medium difficulty

 

2. Array problem

Question: 330 required padded array of Difficulty

Question: After Flip matrix score 861, medium difficulty

 

3. The elements of the problem

Question: rebuild queues 406 according to height, medium difficulty

Question: 630 curriculum III, Difficulty