2018年10月2日
leetcode235 - Lowest Common Ancestor of a Binary Search Tree - easy
摘要： 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: 阅读全文
posted @ 2018-10-02 13:48 jasminemzy 阅读(118) 评论(0) 推荐(0)
leetcode461 - Hamming Distance - easy
摘要： The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calcula 阅读全文
posted @ 2018-10-02 13:34 jasminemzy 阅读(131) 评论(0) 推荐(0)
leetcode268 - Missing Number - easy
摘要： 268. Missing NumberGiven an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.Example 1:Inpu 阅读全文
posted @ 2018-10-02 13:29 jasminemzy 阅读(118) 评论(0) 推荐(0)