摘要：
Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the num 阅读全文
摘要：
Given an integer n and an integer start. Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length. Return the bitwise XOR of 阅读全文
摘要：
Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has. For each kid check if th 阅读全文
摘要：
Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. class So 阅读全文
摘要：
Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. 求数组的前缀和 class Soluti 阅读全文