cmy203的博客

Letf(x)be the number of zeroes at the end ofx!. (Recall thatx! = 1 * 2 * 3 * ... * x, and by convention,0! = 1.)For example,f(3) = 0because 3! = 6 has no zeroes at the end, whilef(11) = 2bec...

Given an arrayA, we may rotate it by a non-negative integerKso that the array becomesA[K], A[K+1], A{K+2], ... A[A.length - 1], A[0], A[1], ..., A[K-1]. Afterward, any entries that are less than ...

In a given integer array A, we must move every element of A to either list B or list C. (B and C initially start empty.)Return true if and only if after such a move, it is possible that the average ...

We are given non-negative integers nums[i] which are written on a chalkboard. Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first. If erasing a number ...

Given a positive integerN, how many ways can we write it as a sum ofconsecutive positive integers?Example 1:Input: 5Output: 2Explanation: 5 = 5 = 2 + 3Example 2:Input: 9Output: 3Explan...

42.Trapping Rain WaterHard306954FavoriteShareGivennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after rainin...

Given an arrayAof positive integers, call a (contiguous, not necessarily distinct) subarray ofAgoodif the number of different integers in that subarray is exactlyK.(For example,[1,2,3,1,2]ha...

Given an arrayAof non-negative integers, the array issquarefulif for every pair of adjacent elements, their sum is a perfect square.Return the number of permutations of A that are squareful. Tw...

Given a single positive integerx, we will write an expression of the formx (op1) x (op2) x (op3) x ...where each operatorop1,op2, etc. is either addition, subtraction, multiplication, or division...