LeetCode – 芒果养乐多

Posted on 2019年3月11日 by LiHui

突然发现了一个leetcode相关的编辑器插件，链接如下：

直接安装插件

安装好之后，通过leetcode账号和密码登录

立马就能列出自己完成的和未完成的题目

可以直接本地编码提交

[……]

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[......]Read more

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[……]

Implement strStr().

Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Example 1:

Input: haystack = "hello", needle = "ll"
Output: 2

Example 2:

I[......]Read more

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array[……]

Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this by modifyin[……]

芒果养乐多