- 我的消息
- 我的博客
- 我的学院
- 我的下载
- 我的收藏
- 消息
-
全部文章 > google
-
LeetCode 42. Trapping Rain Water(java)
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining...
原创2018-01-20 07:10:34160 -
LeetCode 687. Longest Univalue Path(java)
Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the ro...
原创2018-01-19 09:17:48220 -
LeetCode 681. Next Closest Time(java)
Given a time represented in the format “HH:MM”, form the next closest time by reusing the current digits. There is no limit on how many times a digit...
原创2018-01-17 09:55:201560 -
LeetCode 683. K Empty Slots(Java)
There is a garden with N slots. In each slot, there is a flower. The N flowers will bloom one by one in N days. In each day, there will be exactly on...
原创2018-01-16 09:29:164860 -
LeetCode -- Google -- Interview Process. 1. Repeated String Match(java)
Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1.For...
原创2018-01-13 14:36:35400
-
- 学院
- 下载
- 消息