离镜的博客

package array; /* Given an array nums write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. Example: Input: [0,1,0,3,12] Output: [1,3,12,0,...

package array; import java.util.HashMap; public class leetcode169MajorityElement { /* Given an array of size n, find the majority element. The majority element is the element that appear...

package array; import java.util.ArrayList; public class leecode448FindNumbersNotAppear { /*448. Find All Numbers Disappeared in an Array Given an array of integers where 1 ≤ a[i] ≤ n (n = size o...