Leetcode
水林夕smile
这个作者很懒,什么都没留下…
展开
-
【Leetcode 219. Contains Duplicate II】
219. Contains Duplicate IITotal Accepted: 88095 Total Submissions: 281464 Difficulty: Easy Contributors: Admin Given an array of integers and an integer k, find out whether there are two distinct indic原创 2016-12-16 10:01:24 · 517 阅读 · 0 评论 -
【Leetcode 434. Number of Segments in a String】
434. Number of Segments in a StringTotal Accepted: 3749 Total Submissions: 9646 Difficulty: Easy Contributors: love_FDU_llp Count the number of segments in a string, where a segment is defined to be a原创 2016-12-16 10:41:44 · 330 阅读 · 0 评论 -
【Leetcode 112. Path Sum】
113. Path Sum II Total Accepted: 106191Total Submissions: 341245Difficulty: MediumContributors: Admin Given a binary tree and a sum, find all root-to-leaf paths where each原创 2016-12-15 11:23:39 · 218 阅读 · 0 评论 -
【LeetCode】236. Lowest Common Ancestor of a Binary Tree
算法描述 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two node原创 2017-04-10 22:29:41 · 187 阅读 · 0 评论 -
【Leetcode】235. Lowest Common Ancestor of a Binary Search Tree
算法描述 Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betw原创 2017-04-10 22:35:35 · 193 阅读 · 0 评论