llz522730312的专栏

import java.util.ArrayList; import java.util.List; public class MajorElements229 { public List majorityElement1(int[] nums) //算法的精妙之处在于，如果不存在多于三分之一的元素的值，则次多元素是错误的，所有还要在最后做一次遍历和统计。 { List mylist=n

题目要求： 228. Summary Ranges My Submissions Question Editorial Solution Total Accepted: 47215 Total Submissions: 191166 Difficulty: Medium Given a sorted integer array without duplicates, retu

209. Minimum Size Subarray Sum My SubmissionsQuestionEditorial SolutionTotal Accepted: 40966 Total Submissions: 150450 Difficulty: MediumGiven an array of n positive integers and a positive integer s,

public int findPeakElement(int[] nums) { int N = nums.length; if (N == 1) { return 0; } int left = 0, right = N - 1; while (right - left > 1) { int mid = left + (ri

原题如下所示： 153. Find Minimum in Rotated Sorted Array  My Submissions Question Editorial Solution Total Accepted: 96116 Total Submissions: 261936 Difficulty: Medium Suppose a s

题目要求如下： Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following matrix: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7,