摘要：
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: 阅读全文
阅读排行榜
[LeetCode] 23. Merge k Sorted Lists_Hard tag: Linked List
2019-05-03 11:33 by Johnson_强生仔仔, 183 阅读, 收藏,
摘要：
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: Input: [ 1->4->5, 1->3->4, 2->6 ] Output: 阅读全文
[LeetCode] 104. Maximum Depth of Binary Tree_Easy tag: DFS
2018-07-09 23:31 by Johnson_强生仔仔, 183 阅读, 收藏,
摘要：
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
[LeetCode] 744. Find Smallest Letter Greater Than Target_Easy tag: Binary Search
2018-08-20 02:46 by Johnson_强生仔仔, 182 阅读, 收藏,
摘要：
Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list t 阅读全文
[LeetCode] 190. Reverse Bits_Easy tag: Bit Manipulation
2018-08-16 23:13 by Johnson_强生仔仔, 182 阅读, 收藏,
摘要：
Reverse bits of a given 32 bits unsigned integer. Example: Follow up:If this function is called many times, how would you optimize it? 这个题目就是利用Bit Man 阅读全文
浙公网安备 33010602011771号