LeedCode OJ
HDACMer
I am from Soochow University
展开
-
LeetCode----Path Sum
Path Sum Total Accepted: 9765 Total Submissions: 32502 My Submissions Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path eq原创 2014-03-27 19:52:04 · 513 阅读 · 0 评论 -
(LeetCode OJ) Sqrt(x)
题目链接: http://oj.leetcode.com/problems/sqrtx/ 看题目就知道是水题一枚,做这个平台的题目还是没有习惯,毕竟这里的题目都是以面试为目的的,所以Coding的时候一定要谨慎. 附上我的代码: class Solution { public: int sqrt(int x) { if (0 == x) return原创 2014-03-19 12:24:35 · 602 阅读 · 0 评论 -
LeedCode OJ --- Binary Tree Inorder Traversal
点击打开题目链接 今天只是原创 2014-04-26 00:26:42 · 601 阅读 · 0 评论 -
LeedCode OJ -- String to Integer (atoi)
点击打开题目链接 题目意思就是自己实现原创 2014-04-26 17:58:18 · 668 阅读 · 0 评论