Commit c0e298d

committed

1 problem

1 parent 00de989 commit c0e298dCopy full SHA for c0e298d

File tree

+22

-0

lines changed

+22

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -236,6 +236,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t`
`236`	`236`	`#### [326. Power of Three](https://github.com/hitzzc/go-leetcode/tree/master/power_of_three)`
`237`	`237`	`#### [327. Count of Range Sum](https://github.com/hitzzc/go-leetcode/tree/master/count_of_range_sum)`
`238`	`238`	`#### [329. Longest Increasing Path in a Matrix](https://github.com/hitzzc/go-leetcode/tree/master/longest_increasing_path_in_a_matrix)`
	`239`	`+#### [331. Verify Preorder Serialization of a Binary Tree](https://github.com/hitzzc/go-leetcode/tree/master/verify_preorder_serialization_of_a_binary_tree)`
`239`	`240`
`240`	`241`
`241`	`242`

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+class Solution {`
	`2`	`+public:`
	`3`	`+ bool isValidSerialization(string preorder) {`
	`4`	`+ int idx = 0;`
	`5`	`+ return helper(preorder, idx) ? idx == preorder.size() ? true : false : false;`
	`6`	`+ }`
	`7`	`+`
	`8`	`+ bool helper(string& preorder, int& idx) {`
	`9`	`+ if (idx == preorder.size()) return false;`
	`10`	`+ int start = idx;`
	`11`	`+ while (idx < preorder.size() && preorder[idx] != ',') ++idx;`
	`12`	`+ if (idx == preorder.size()) {`
	`13`	`+ return preorder.substr(start) == "#" ? true : false;`
	`14`	`+ }`
	`15`	`+ ++idx;`
	`16`	`+ if (preorder.substr(start, idx-start-1) == "#")`
	`17`	`+ return true;`
	`18`	`+ if (!helper(preorder, idx)) return false;`
	`19`	`+ return helper(preorder, idx);`
	`20`	`+ }`
	`21`	`+};`

Comments

(0)