The count-and-say sequence is the sequence of integers with the first five terms as following:
1. 1 2. 11 3. 21 4. 1211 5. 111221
1 is read off as “one 1” or 11.
11 is read off as “[……]
分类：LeetCode
LeetCode 35：Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Ex[……]
LeetCode 34：Find First and Last Position of Element in Sorted Array
Given an array of integers nums sorted in ascending order, find the starting and ending position of a given targetvalue.
Your algorithm’s runtime complexity must be in the order of O(log n).
If the ta[……]
LeetCode 33：Search in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You are given a target value to search. If found[……]
VSCode关于LeetCode的扩展插件
突然发现了一个leetcode相关的编辑器插件，链接如下：
https://marketplace.visualstudio.com/items?itemName=shengchen.vscode-leetcode
直接安装插件
安装好之后，通过leetcode账号和密码登录
立马就能列出自己完成的和未完成的题目
可以直接本地编码提交
[……]
LeetCode 32：Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
Example 1:
Input: "(()" Output: 2 Explanation: The longest valid pa[......]
LeetCode 31：Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
If such arrangement is not possible, it must rearrange it as the lowest possible or[……]
LeetCode 25：Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
k is a positive integer and is less than or equal to the length of the linked list. If the number of n[……]
LeetCode 24：Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.
Example:
Given1->2->3->4, you should return the list as2->1->4->3.
Note:
- Your algorithm should use only con[……]