int main() { TreeNode* head = new TreeNode(16); TreeNode* left = new TreeNode(10); TreeNode* right = new TreeNode(20); head->left = left; head->right = right; Solution s = Solution(); TreeNode* result = s.Convert(head); cout<<result->val<<"->"<<result->right->val<<"->"<<result->right->right->val<<endl; }
int main() { vector<int> digits; int num; cin>>num; Solution s; s.Convert(num,digits); for(auto v:digits) cout<<v<<" "; cout<<endl; s.plusOne(digits); for(auto v:digits) cout<<v<<" "; cout<<endl; }