Rehabilitation type force buckle brushing notes d2

catalogue Code part Question 9 Question 13 Question 14 Question 20 Question 4 Question 21 Question 15 java small knowledge part Question 9 Question 13 Question 14 Question 20 Question 4 Question 15 Code part Question 9 Give you an integer X. if x is a palindrome integer, return true; Otherwise, false is returned. Palindr ...

Added by XeroXer on Thu, 06 Jan 2022 00:17:12 +0200

Java description LeetCode, 501 Find mode in binary search tree detailed explanation of Morris algorithm

Hello everyone, I'm hehaige and focus on the back end. If I can, I want to be a code designer instead of an ordinary coder to witness the growth of hehaige. Your comments and praise are my biggest driving force. If you have any mistakes, please don't hesitate to comment. Thank you very much. Let's support the original! If there is a clerical er ...

Added by cyclops on Thu, 06 Jan 2022 00:05:13 +0200

Force buckle - string

1, String common api string class functionexplainchar charAt(int index)Returns the value at the index specified by char.boolean contains(CharSequence s)Returns true if and only if this string contains the specified sequence of char values.boolean equals(Object anObject)Compares this string with the specified objectboolean isEmpty()Returns tru ...

Added by metalblend on Wed, 05 Jan 2022 23:35:15 +0200

LeetCode-Day83(C++) 116. Populates the next right node pointer for each node

Populates the next right node pointer for each node Given a perfect binary tree, all leaf nodes are in the same layer, and each parent node has two child nodes. Binary tree is defined as follows: struct Node { int val; Node *left; Node *right; Node *next; } Fill in each of its next pointers so that this pointer points to its next right node. I ...

Added by scottgum on Wed, 05 Jan 2022 17:54:49 +0200

[Leetcode data structure algorithm] merge two ordered arrays (sequential table)

Title Content: You are given two integer arrays nums1 and nums2 in non decreasing order, and two integers m and n representing the number of elements in nums1 and nums2 respectively. Please merge nums2 into nums1 so that the merged array is also arranged in non decreasing order. Note: the final merged array should not be returned by the fun ...

Added by clarket on Wed, 05 Jan 2022 17:38:06 +0200

Brush Title LeetCode: 4 Find the median of two positively ordered arrays

Link Title:Force buckle Title Description Give two positively ordered (from small to large) arrays nums1 and nums2 of sizes m and n, respectively. Please find and return the median of these two positive arrays. The time complexity of the algorithm should be O(log (m+n)) Topic analysis Conventional thinking: 1. Merge two arrays in sorti ...

Added by electrix on Wed, 05 Jan 2022 14:45:20 +0200

Solution to the problem of Luogu P1656 bombing Railway

The first title of konjaku Original question link Er, first simplify the meaning of the question. The general meaning is to let you blow up one of the m railways, so that two of the n cities are not connected (the idea of using and searching the set is to let you cut off one edge, so that there are two connected blocks). If you don't look at ...

Added by thepeccavi on Wed, 05 Jan 2022 05:18:59 +0200

leetcode — 402. Remove K digits

Give you a non negative integer , num , represented by a string and an integer , k , and remove the , k , digits in this number to minimize the remaining numbers. Please return this minimum number as a string. Example 1: Input: num = "1432219", k = 3 Output: "1219" Explanation: remove the three numbers 4, 3, and 2 t ...

Added by Gregghawes on Wed, 05 Jan 2022 01:18:54 +0200

Sword finger Offer 37 Serialized binary tree

Please implement two functions to serialize and deserialize the binary tree respectively. You need to design an algorithm to realize the serialization and deserialization of binary tree. There is no restriction on the execution logic of your sequence / deserialization algorithm. You only need to ensure that a binary tree can be serialized into ...

Added by AngusL on Tue, 04 Jan 2022 23:05:31 +0200

2022-01-01 swipe questions and punch in every day

2022-01-01 swipe questions and punch in every day (happy New Year's Day!!!) Flying book - daily question 394. String decoding Given an encoded string, returns its decoded string. The coding rule is: k[encoded_string], indicating the encoded inside the square brackets_ String is repeated exactly k times. Note that K is guaranteed to be a pos ...

Added by Fjerpje on Tue, 04 Jan 2022 22:10:54 +0200