小白兔云

2019年4月24日

leetcode [173]Binary Search Tree Iterator

摘要： Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the n 阅读全文

posted @ 2019-04-24 17:07 小白兔云阅读(97) 评论(0) 推荐(0)

leetcode [201]Bitwise AND of Numbers Range

摘要： Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. Example 1: Example 2: 题目大意：返回[m 阅读全文

posted @ 2019-04-24 15:38 小白兔云阅读(108) 评论(0) 推荐(0)

leetcode [200]Number of Islands

摘要： Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen 阅读全文

posted @ 2019-04-24 15:02 小白兔云阅读(118) 评论(0) 推荐(0)

leetcode [199]Binary Tree Right Side View

摘要： Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 阅读全文

posted @ 2019-04-24 14:54 小白兔云阅读(86) 评论(0) 推荐(0)

2019年4月23日

leetcode[166]Fraction to Recurring Decimal

摘要：恢复内容开始 Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is re 阅读全文

posted @ 2019-04-23 21:23 小白兔云阅读(117) 评论(0) 推荐(0)

leetcode [165]Compare Version Numbers

摘要： Compare two version numbers version1 and version2.If version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0. You may assume 阅读全文

posted @ 2019-04-23 19:34 小白兔云阅读(109) 评论(0) 推荐(0)

Netty源码分析之服务端启动

摘要： Netty服务端启动代码： 1.Channel的创建通过Bootstrap.bind(PORT)调用AbstractBootstrap.doBind()，doBind()调用initAndRegister()。从该方法可以看出，channel的创建是依赖channelFactory().newC 阅读全文

posted @ 2019-04-23 16:48 小白兔云阅读(206) 评论(0) 推荐(0)

2019年4月22日

leetcode [152]Maximum Product Subarray

摘要： Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: E 阅读全文

posted @ 2019-04-22 20:57 小白兔云阅读(101) 评论(0) 推荐(0)

leetcode [162]Find Peak Element

摘要： A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return 阅读全文

posted @ 2019-04-22 20:20 小白兔云阅读(179) 评论(0) 推荐(0)

leetcode [153]Find Minimum in Rotated Sorted Array

摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). F 阅读全文

posted @ 2019-04-22 19:34 小白兔云阅读(99) 评论(0) 推荐(0)

公告