2019年1月15日

Leetcode 399. Evaluate Division

摘要: Problem: Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point numbe 阅读全文

posted @ 2019-01-15 07:05 周浩炜 阅读(273) 评论(0) 推荐(0) 编辑

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) 编辑

2019年1月13日

Leetcode 759. Employee Free Time

摘要: Problem: We are given a list schedule of employees, which represents the working time for each employee. Each employee has a list of non-overlapping I 阅读全文

posted @ 2019-01-13 15:08 周浩炜 阅读(317) 评论(0) 推荐(0) 编辑

Leetcode 146. LRU Cache

摘要: Problem: Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) 阅读全文

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

Leetcode 745. Prefix and Suffix Search

摘要: Problem: Given many words, words[i] has weight i. Design a class WordFilter that supports one function, WordFilter.f(String prefix, String suffix). It 阅读全文

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

Leetcode 753. Cracking the Safe

摘要: Problem: There is a box protected by a password. The password is n digits, where each letter can be one of the first k digits 0, 1, ..., k-1. You can 阅读全文

posted @ 2019-01-13 11:45 周浩炜 阅读(173) 评论(0) 推荐(0) 编辑

Leetcode 527. Word Abbreviation

摘要: Problem: Given an array of n distinct non-empty strings, you need to generate minimal possible abbreviations for every word following rules below. Beg 阅读全文

posted @ 2019-01-13 10:16 周浩炜 阅读(199) 评论(0) 推荐(0) 编辑

导航