抹茶小一的博客

题目： Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. Note: Each element in the result should appear as

题目： You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of

题目： Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. 思路与步骤： 思路1： 先排序，然后将数组与下标比较，第一次出现不相等的下标即确实数据。 学习别人的思路： 思路2： 先对0到

题目： Given an 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

题目： Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leading zero, except the number 0 itself. The dig