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:34

阅读数:16

评论数:0

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:48

阅读数:35

评论数:0

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:20

阅读数:195

评论数:0

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:16

阅读数:689

评论数:0

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:35

阅读数:53

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭