# Leetcode习题解统计

【简单】1-两数之和 Two Sum

【中等】3-无重复字符的最长子串 Longest Substring Without Repeating Characters

【困难】4-寻找两个有序数组的中位数 Median of Two Sorted Arrays

【中等】22-括号生成 Generate Parentheses

【中等】542 - 01 矩阵 01 Matrix

## Leetcode 详解（ReverseWords）

Leetcode里面关于字符串的一些问题,描述如下: Given an input string, reverse the string word by word. For example,Given s = "the sky is blue",return "blue is sky the". Update (2015-02-12):For C programmers: Try to solve it inO(1) space. click to show cla

## The Skyline Problem leetcode 详解

class Solution { public: vector<pair<int, int>> getSkyline(vector<vector<int>>& buildings) { vector<pair<int, int> > h, res; multiset<int> m; int pre = 0, cur = 0; for (auto &a : buildings) { h.push_back({

## LeetCode 全解

1.Two Sum Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. 使用hash public int[] twoSum

## (LeetCode)Count Primes --- 统计素数（质数）

Description: Count the number of prime numbers less than a non-negative number, n. Credits: Special thanks to @mithmatt for adding this problem and creating all test cases. Hint: Let's start with a isPrime function. To determine if a number is prime,