2018年4月14日
leetcode 405. Convert a Number to Hexadecimal
摘要： Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used. Note: Example 1: Example 2: 阅读全文
posted @ 2018-04-14 23:32 bonelee 阅读(227) 评论(0) 推荐(0)
leetcode 21. Merge Two Sorted Lists
摘要： Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Example: 阅读全文
posted @ 2018-04-14 22:33 bonelee 阅读(256) 评论(0) 推荐(0)
leetcode 70. Climbing Stairs
摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文
posted @ 2018-04-14 13:09 bonelee 阅读(272) 评论(0) 推荐(0)
leetcode 257. Binary Tree Paths
摘要： Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: All root-to-leaf paths are: stack 迭代解法： BFS:（和dfs st 阅读全文
posted @ 2018-04-14 12:58 bonelee 阅读(182) 评论(0) 推荐(0)
leetcode 720. Longest Word in Dictionary
摘要： Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other wo 阅读全文
posted @ 2018-04-14 11:55 bonelee 阅读(348) 评论(0) 推荐(0)
Trie（前缀树/字典树）及其应用
摘要： from:https://www.cnblogs.com/justinh/p/7716421.html Trie，又经常叫前缀树，字典树等等。它有很多变种，如后缀树，Radix Tree/Trie，PATRICIA tree，以及bitwise版本的crit-bit tree。当然很多名字的意义其实 阅读全文
posted @ 2018-04-14 10:52 bonelee 阅读(53737) 评论(1) 推荐(7)