程序媛詹妮弗
终身学习
上一页 1 ··· 18 19 20 21 22 23 24 25 26 ··· 30 下一页
摘要: 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. 阅读全文
posted @ 2018-06-21 10:10 程序媛詹妮弗 阅读(238) 评论(0) 推荐(0) 编辑
摘要: Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文
posted @ 2018-06-21 10:00 程序媛詹妮弗 阅读(154) 评论(0) 推荐(0) 编辑
摘要: Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. Example 1: Exampl 阅读全文
posted @ 2018-06-21 06:58 程序媛詹妮弗 阅读(176) 评论(0) 推荐(0) 编辑
摘要: There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it cost 阅读全文
posted @ 2018-06-21 06:46 程序媛詹妮弗 阅读(360) 评论(0) 推荐(0) 编辑
摘要: 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 @ 2018-06-21 06:18 程序媛詹妮弗 阅读(127) 评论(0) 推荐(0) 编辑
摘要: Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Foll 阅读全文
posted @ 2018-06-21 06:06 程序媛詹妮弗 阅读(179) 评论(0) 推荐(0) 编辑
摘要: Build Your First Website 装一个subline text HTML default rule tags with opening and closing DEVELOPER FUNDAMENTALS:III doctype says, hey just a heads up 阅读全文
posted @ 2018-06-21 06:00 程序媛詹妮弗 阅读(256) 评论(0) 推荐(0) 编辑
摘要: WWW vs Internet For the begining, Internet was there. it was for the academics among universities Then they need a way to share documents in the whole 阅读全文
posted @ 2018-06-21 04:00 程序媛詹妮弗 阅读(125) 评论(0) 推荐(0) 编辑
摘要: Browsing the web Enter google.com, who is this google.com This question gets asked all the way down to our ISP(Internet Service Provider), like Verizo 阅读全文
posted @ 2018-06-21 02:50 程序媛詹妮弗 阅读(178) 评论(0) 推荐(0) 编辑
摘要: Given a string, find the length of the longest substring T that contains at most k distinct characters. For example, Given s = “eceba” and k = 2, T is 阅读全文
posted @ 2018-06-20 03:41 程序媛詹妮弗 阅读(120) 评论(0) 推荐(0) 编辑
上一页 1 ··· 18 19 20 21 22 23 24 25 26 ··· 30 下一页