weixin_42259580的博客

Digit Counts Description Count the number of k’s between 0 and n. k can be 0 - 9. Example # Example1 Input: k = 1, n = 1 Output: 1 Explanation: In [0, 1], we found that 1 appeared once (1). # Exampl...

Shuffle an Array Description Shuffle a set of numbers without duplicates. Example // Init an array with set 1, 2, and 3. int[] nums = {1,2,3}; Solution solution = new Solution(nums); // Shuffle the a...

Trailing Zeros Description Write an algorithm which computes the number of trailing zeros in n factorial. Example # Example1 Input: 11 Output: 2 Explanation: 11! = 39916800, so the output should b...

Longest Substring Without Repeating Characters Description Given a string, find the length of the longest substring without repeating characters. Example Example 1: Input: "abcabcbb" Output: 3 Expla...