qq_38673195的博客

leetcode 189 Given an array, rotate the array to the right by k steps, where k is non-negative. 方法一 开辟新数组，使用取余求下标的方法 class Solution { public void rotate(int[] nums, int k) { int[] temp=new...

leetcode 217 Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if eve...

Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without usin...