Custom regular expression matching algorithm for Java

preface Customize the regular expression rules, and then complete the implementation of the matching algorithm. 1, Title Please implement a function to match regular expressions containing '.' and '*'. The character '.' in the mode represents any character, and '/ *' represents that the character before it can appear any time (in ...

Added by mbaroz on Wed, 01 Dec 2021 10:55:44 +0200

Recursive divide and conquer --- example 2. Chessboard coverage

Recursive divide and Conquer - Example 2. Chessboard coverage 1, Problem description In a chessboard composed of 2^k x 2k squares, exactly one square is incomplete. There are 2(2k) positions of incomplete squares. Therefore, there are 2^(2k) kinds of incomplete chessboard with K ≥ 0 In the problem of chessboard coverage, it is required t ...

Added by zedan_80 on Wed, 01 Dec 2021 00:57:27 +0200

LeetCode-131 split palindrome string

Split palindrome stringTitle Description: give you a string s. please divide s into some substrings so that each substring is a palindrome string. Returns s all possible segmentation schemes.A palindrome string is a string that reads the same forward and reverse.See LeetCode's official website for an example.Source: LeetCode Link: https://leet ...

Added by flashicon on Sun, 28 Nov 2021 03:44:42 +0200

LeetCode897 incremental sequential search tree & sword finger OfferII 052 flattening binary search tree

subject Problem solving The increasing order of binary search tree is the order of middle order traversal. LeetCode426 transforms binary search tree into sorted two-way linked list & sword finger Offer 36 binary search tree and two-way linked list The simple version of question 426 needs to construct a two-way circular linked list ...

Added by RobinTibbs on Thu, 04 Nov 2021 12:19:32 +0200