StackEdit
Welcome to StackEdit! Hey! I'm your first Markdown document in StackEdit[1]. Don't delete me, I'm very helpful! I can be recovered anyway in the Utils tab of the Settings dialog. Documents StackEdit stores your documents in your browser, which means all your documents are automatically saved locally and are…
【leetcode】606. Construct String from Binary Tree
【题目】 You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be represented by empty parenthesis pair "()". And you need to omit all the empty parenthesis pairs that don't affect the one-to-one mapping relationship between…
Markdown测试
欢迎使用 Cmd Markdown 编辑阅读器 我们理解您需要更便捷更高效的工具记录思想,整理笔记、知识,并将其中承载的价值传播给他人,Cmd Markdown 是我们给出的答案 —— 我们为记录思想和分享知识提供更专业的工具。 您可以使用 Cmd Markdown: 整理知识,学习笔记 发布日记,杂文,所见所想 撰写发布技术文稿(代码支持) 撰写发布学术论文(LaTeX 公式支持) 除了您现在看到的这个 Cmd Markdown 在线版本,您还可以前往以下网址下载: Windows/Mac/Linux 全平台客户端 请保留此份 Cmd Markdown 的欢迎稿兼使用说明,如需撰写新稿件,点击顶部工具栏右侧的 新文稿 或者使用快捷键 Ctrl+Alt+N。 什么是 Markdown Markdown 是一种方便记忆、书写的纯文本标记语言,…
【leetcode】9. Palindrome Number
问题描述:Determine whether an integer is a palindrome. Do this without extra space. 翻译:判断一个整数是否为回文序列,要求不要使用额外的存储空间。 【c++版】 class Solution { public: bool isPalindrome(int x) { } }; 解题答案,步骤挺清晰的,思路也清晰: class Solution { public: bool isPalindrome(int x) { string tmp; if(!x) return true; else if(x < 0) return false; // x = abs(…
Welcome to Ghost
Hey! Welcome to Ghost, it's great to have you :) We know that first impressions are important, so we've populated your new site with some initial Getting Started posts that will help you get familiar with everything in no time. This is the first one! There are a few things that…