為您找到相關(guān)結(jié)果125,002個
C++實(shí)現(xiàn)LeetCode(131.拆分回文串)_C 語言_腳本之家
[LeetCode] 131.Palindrome Partitioning 拆分回文串Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.Example:Input: "aab" Output: [ ["aa","b"], ["a","a","b"] ]...
www.dbjr.com.cn/article/2170...htm 2025-5-28
C++實(shí)現(xiàn)LeetCode(136.單獨(dú)的數(shù)字)_C 語言_腳本之家
[LeetCode] 136.Single Number 單獨(dú)的數(shù)字Given a non-empty array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?Example 1:...
www.dbjr.com.cn/article/2176...htm 2025-5-25
C++實(shí)現(xiàn)LeetCode(99.復(fù)原二叉搜索樹)_C 語言_腳本之家
[LeetCode] 99. Recover Binary Search Tree 復(fù)原二叉搜索樹Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Example 1:Input: [1,3,null,null,2] 1 / 3 \ 2 Output: [3,1,null,null,2] 3 / 1 \ 2Example 2:...
www.dbjr.com.cn/article/2177...htm 2025-6-1
C++實(shí)現(xiàn)LeetCode(124.求二叉樹的最大路徑和)_C 語言_腳本之家
[LeetCode] 124. Binary Tree Maximum Path Sum 求二叉樹的最大路徑和Given a non-empty binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must ...
www.dbjr.com.cn/article/2181...htm 2025-6-5