水中的鱼

Follow up for problem " Populating Next Right Pointers in Each Node ". What if the given tree could be any binary tree? Would ...

Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Po...

Given a number represented as an array of digits, plus one to the number. » Solve this problem [解题思路] 加位与进位。模拟。 [Code] 1: vector<...

Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2]  have the fo...

Given a collection of numbers, return all possible permutations. For example, [1,2,3]  have the following permutations: [1,2,3] ,  [...

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below bin...

Given an index  k , return the  k th  row of the Pascal's triangle. For example, given  k  = 3, Return  [1,3,3,1] . [ [1], ...