DescriptionSuppose 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 ...

DescritionA peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], find a peak element and retur ...

DescirptionRotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1, ...

BackgroundKMP算法是常会考察的算法，这次全部搞通。首先，这是一个典型的字符串匹配问题，起源是看九章算法基础班视频的时候，第一个就讲的strStr，首先来个直接给面试官的回答。1234567891011121314151617public int strStr(String source, ...

DescriptionGiven an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[ ...

DescriptionGiven a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return [“0->2”,”4-& ...

DescriptionGiven an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1 ...

DescriptionGiven an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assu ...

DescriptionGiven an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements o ...

DescriptionGiven an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array. For example,Given nums ...