2019年1月14日

Leetcode 715. Range Module

摘要: Problem: A Range Module is a module that tracks ranges of numbers. Your task is to design and implement the following interfaces in an efficient manne 阅读全文

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

Leetcode 57. Insert Interval

摘要: Problem: Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals we 阅读全文

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

Leetcode 493. Reverse Pairs

摘要: Problem: Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j]. You need to return the number of important re 阅读全文

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

Leetcode 315. Count of Smaller Numbers After Self

摘要: Problem: You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the numbe 阅读全文

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

导航