这是一个菜鸡的博客

题目： class Solution { public: int searchInsert(vector<int>& nums, int target) { int position = 0; int low = 0; int up = nums.size()-1; int mid; ...

Count and Say class Solution { public: string countAndSay(int n) { string ret = "1"; string Tempret; int count1,i; char read; while(--n) { ...

问题描述： To some string S, we will perform some replacement operations that replace groups of letters with new ones (not necessarily the same size). Each replacement operation has 3 parameters: a start...

3. Longest Substring Without Repeating Characters Medium 4549225FavoriteShare Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" ...

问题描述： There are N rooms and you start in room 0.  Each room has a distinct number in 0, 1, 2, ..., N-1, and each room may have some keys to access the next room.  Formally, each room i has a list of...

问题描述： Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so...