2015年10月11日
【ACM从零开始】LeetCode OJ-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 thedefinition of LCA on Wikipedia: ... 阅读全文
posted @ 2015-10-11 14:50 Shvier 阅读(158) 评论(0) 推荐(0)
【ACM从零开始】LeetCode OJ-Delete Node in a Linked List
摘要： Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is1 -> 2 -> 3 -> ... 阅读全文
posted @ 2015-10-11 14:02 Shvier 阅读(162) 评论(0) 推荐(0)