2019年1月6日

Leetcode 42. Trapping Rain Water

摘要： Problem: 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 阅读全文

posted @ 2019-01-06 17:08 周浩炜 阅读(186) 评论(0) 推荐(0) 编辑

Leetcode 920. Number of Music Playlists

摘要： Problem: Your music player contains N different songs and she wants to listen to L(not necessarily different) songs during your trip. You create a pla 阅读全文

posted @ 2019-01-06 14:01 周浩炜 阅读(444) 评论(0) 推荐(0) 编辑

Leetcode 689. Maximum Sum of 3 Non-Overlapping Subarrays

摘要： Problem: In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we wa 阅读全文

posted @ 2019-01-06 09:30 周浩炜 阅读(262) 评论(0) 推荐(0) 编辑

Leetcode 312. Burst Balloons

摘要： Problem: Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all th 阅读全文

posted @ 2019-01-06 05:38 周浩炜 阅读(168) 评论(0) 推荐(1) 编辑

导航