a8814828的专栏

void rotate(int nums[], int n, int k) { int temp; int nums1[n]; for (int y=0;y<n;y++){ nums1[(y+k+n)%n]=nums[y+n%n]; } for (int i=0;i<n;i++){ nums[i]=nums1[i];}}

**Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity.**int trailingZeroes(int n) { int s=0; while ((n/5)!=0) {

Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1B -> 2C -> 3...Z -> 26AA -> 27AB -> 28 int

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element always