Tag:Force buckle

  • Leecode brush questions everyday 2

    Time:2022-7-29

    Leecode brush questions everyday 2 Title Description move zero Given an array num, write a function to move all zeros to the end of the array while maintaining the relative order of non-zero elements. Please note that you must operate on the array in place without copying it.   Example 1: Input: num = [0,1,0,3,12] […]

  • Leetcode determines whether paths intersect

    Time:2022-7-27

    order This paper mainly records whether the paths of leetcode intersect subject Give you a string path, where the value of path[i] can be’n’,’s’,’e’or’ W ‘, which means moving one unit north, South, East and west respectively. The robot starts from the origin (0, 0) on the two-dimensional plane and walks according to the path […]

  • Leetcode merges two ordered arrays

    Time:2022-7-20

    order This article mainly records the merging of two ordered arrays of leetcode subject Here are two ordered integer arrays nums1 and nums2. Please merge nums2 into nums1 to make nums1 an ordered array.   explain: The number of elements initializing nums1 and nums2 is m and N respectively. You can assume that nums1 has […]

  • The kth missing positive integer of leetcode

    Time:2022-7-19

    order This paper mainly records the k-th missing positive integer of leetcode subject Give you a strictly ascending array of positive integers arr and an integer K. Please find the k-th missing positive integer in this array.   Example 1: Input: arr = [2,3,4,7,11], k = 5 Output: 9 Explanation: missing positive integers include [1,5,6,8,9,10,12,13,…]. […]

  • Fibonacci number of leetcode

    Time:2022-7-18

    order This paper mainly records the Fibonacci number of leetcode subject Fibonacci numbers are usually represented by F (n), and the sequence formed is called Fibonacci sequence. The sequence starts with 0 and 1, and each subsequent number is the sum of the previous two numbers. That is: F(0) = 0,   F(1) = 1 F (n) […]

  • Whether leetcode can form an arithmetic sequence

    Time:2022-7-14

    order This article mainly records whether leetcode’s judgment can form an arithmetic sequence subject Give you an array of numbers arr. If the difference between any two adjacent terms in a sequence is always equal to the same constant, then this sequence is called an equal difference sequence. If the array can be rearranged to […]

  • Moving zero of leetcode

    Time:2022-7-11

    order This article mainly records the moving zero of leetcode subject Given an array num, write a function to move all zeros to the end of the array while maintaining the relative order of non-zero elements. Example: Input: [0,1,0,3,12] Output: [1,3,12,0,0] explain: You must operate on the original array and cannot copy additional arrays. Minimize […]

  • Most elements of leetcode

    Time:2022-7-7

    order This article mainly records most elements of leetcode subject Given an array of size n, find most of its elements. Most elements refer to elements that appear more than ⌊ n/2 ⌋ in the array. You can assume that the array is non empty and that there are always many elements in a given […]

  • Rearranging array of leetcode

    Time:2022-7-2

    order This paper mainly studies the rearrangement array of leetcode subject Here is an array nums. There are 2n elements in the array, which are arranged in the format of [x1, X2,…, xn, Y1, Y2,…, yn]. Please rearrange the array in the format of [x1, Y1, X2, Y2,…, xn, yn] and return the rearranged array. […]

  • The third largest number of leetcode

    Time:2022-7-1

    order This paper mainly studies the third largest number of leetcode subject Given a non empty array, returns the third largest number in the array. If it does not exist, the maximum number in the array is returned. The algorithm time complexity must be o (n). Example 1: Input: [3, 2, 1] Output: 1 Explanation: […]

  • The new version of likuo app is enhanced with epic level!

    Time:2022-6-17

    The new version of likuo app is enhanced with epic level! This revision is really different. Almost all the functions of the PC can be seen in the new app, and the experience is better. Not only have all the things that annoyed me before disappeared, but also there are some useful functions that I […]

  • From zero to Google programmer: my experience of writing questions in interview

    Time:2022-6-8

    Author: Yi Xiao Her GitHub:https://github.com/lilyzhaoyilu Hello, I’m Yi Xiao, who is also a familiar dog head in the 91 algorithm group. Recently, the application and interview have been basically completed. It has just passedGoogle HC。 My undergraduate study is business, so it isLiberal arts transcodingand0 basic transcodingA member of. Here I would like to share […]