Vimer.Bai的博客

LeetCode 34. Search for a RangeDescriptionGiven an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be

LeetCode 344. Reverse String Description Write a function that takes a string as input and returns the string reversed. Example: Given s = “hello”, return “olleh”. class Solution {

LeetCode 345. Reverse Vowels of a String Description Write a function that takes a string as input and reverse only the vowels of a string. Example 1: Given s = “hello”, return “holle”. Exa

LeetCode 11. Container With Most Water Description Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two en

LeetCode 20. Valid Parentheses Description Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the co

LeetCode 9. Palindrome Number Description Determine whether an integer is a palindrome. Do this without extra space. class Solution { public boolean isPalindrome(int x) {

LeetCode 438. Find All Anagrams in a String Description Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s. Strings consists of lowercase English letters o

387. First Unique Character in a String Description Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1. Examples: s = “leetcode”...

434. Number of Segments in a String Description Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters. Please note that the stri...

LeetCode 125. Valid Palindrome Description Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring other cases. For example, “A man, a plan, a cana

LeetCode 167. Two Sum II - Input array is sorted Description Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target numbe

LeetCode 215. Kth Largest Element in an Array Description Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct eleme

LeetCode 728. Self Dividing NumbersDescriptionA self-dividing number is a number that is divisible by every digit it contains.For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 ==

LeetCode 27. Remove ElementDescriptionGiven an array and a value, 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 b

LeetCode 209. Minimum Size Subarray Sum Description Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there

76. Minimum Window Substring Description Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = “ADOBECODEB

leetCode 3. Longest Substring Without Repeating Characters Description Given a string, find the length of the longest substring without repeating characters. Examples: Given “abcabcbb”, the an

LeetCode 80. Remove Duplicates from Sorted Array II Description Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice? For example, Given sorted array nums = [1,1,1,2,

LeetCode 75. Sort Colors Description Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and

LeetCode 88. Merge Sorted Array Description Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough space (size

56. Merge Intervals Description Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. class Soluti...