1457. Pseudo-Palindromic Paths in a Binary Tree "Python" | LeetCode

Опубликовано: 14 Сентябрь 2022
на канале: Sugar Coat

139

I know my English is not that good😅 but I'm trying my best to improve it
thank you 🤭.

Given a binary tree where node values are digits from 1 to 9. A path in the binary tree is said to be pseudo-palindromic if at least one permutation of the node values in the path is a palindrome.

Return the number of pseudo-palindromic paths going from the root node to leaf nodes.

Example 1:
Input: root = [2,3,1,3,1,null,1]
Output: 2
Explanation: The figure above represents the given binary tree. There are three paths going from the root node to leaf nodes: the red path [2,3,3], the green path [2,1,1], and the path [2,3,1]. Among these paths only red path and green path are pseudo-palindromic paths since the red path [2,3,3] can be rearranged in [3,2,3] (palindrome) and the green path [2,1,1] can be rearranged in [1,2,1] (palindrome).

Example 2:
Input: root = [2,1,1,1,3,null,null,null,null,null,1]
Output: 1
Explanation: The figure above represents the given binary tree. There are three paths going from the root node to leaf nodes: the green path [2,1,1], the path [2,1,3,1], and the path [2,1]. Among these paths only the green path is pseudo-palindromic since [2,1,1] can be rearranged in [1,2,1] (palindrome).

code : https://github.com/anandchauhan21/dai...

profile https://linktr.ee/anandchauhan

На этой странице сайта вы можете посмотреть видео онлайн 1457. Pseudo-Palindromic Paths in a Binary Tree "Python" | LeetCode длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Sugar Coat 14 Сентябрь 2022, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 139 раз и оно понравилось 3 зрителям. Приятного просмотра!

616