摘要: 原题链接在这里:https://leetcode.com/problems/meeting-rooms-ii/ 题目: Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2 阅读全文
posted @ 2016-02-22 11:51 Dylan_Java_NYC 阅读(785) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/meeting-rooms/ 题目: Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],. 阅读全文
posted @ 2016-02-22 11:31 Dylan_Java_NYC 阅读(736) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/one-edit-distance/ 题目: Given two strings s and t, determine if they are both one edit distance apart. Note: Ther 阅读全文
posted @ 2016-02-22 07:24 Dylan_Java_NYC 阅读(399) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/binary-tree-upside-down/ 题目: Given a binary tree where all the right nodes are either leaf nodes with a sibling 阅读全文
posted @ 2016-02-22 04:30 Dylan_Java_NYC 阅读(579) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/binary-search-tree-iterator/ 题目: Implement an iterator over a binary search tree (BST). Your iterator will be in 阅读全文
posted @ 2016-02-22 02:55 Dylan_Java_NYC 阅读(268) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/inorder-successor-in-bst/ 题目: Given a binary search tree and a node in it, find the in-order successor of that n 阅读全文
posted @ 2016-02-22 02:24 Dylan_Java_NYC 阅读(609) 评论(0) 推荐(0) 编辑