北叶青藤

2019年7月18日

摘要： Given a rows x cols screen and a sentence represented by a list of words, find how many times the given sentence can be fitted on the screen. Note: A 阅读全文

posted @ 2019-07-18 12:58 北叶青藤阅读(220) 评论(0) 推荐(0)

Count Different Palindromic Subsequences

摘要： Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo 10^9 + 7. A subsequence of a str 阅读全文

posted @ 2019-07-18 12:01 北叶青藤阅读(284) 评论(0) 推荐(0)

2019年7月17日

Sliding Puzzle

摘要： On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0. A move consists of choosing 0 and a 4 阅读全文

posted @ 2019-07-17 14:05 北叶青藤阅读(276) 评论(0) 推荐(0)

LFU Cache

摘要： Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: getand put. get(key) - Get th 阅读全文

posted @ 2019-07-17 12:48 北叶青藤阅读(232) 评论(0) 推荐(0)

2019年7月15日

Consecutive Numbers Sum

摘要： Given a positive integer N, how many ways can we write it as a sum of consecutive positive integers? Example 1: Example 2: Example 3: 分析：https://leetc 阅读全文

posted @ 2019-07-15 11:09 北叶青藤阅读(310) 评论(0) 推荐(0)

Design HashMap

摘要： Design a HashMap without using any built-in hash table libraries. To be specific, your design should include these functions: put(key, value) : Insert 阅读全文

posted @ 2019-07-15 10:54 北叶青藤阅读(215) 评论(0) 推荐(0)

528. Random Pick with Weight

摘要： Given an array w of positive integers, where w[i] describes the weight of index i, write a function pickIndex which randomly picks an index in proport 阅读全文

posted @ 2019-07-15 09:19 北叶青藤阅读(110) 评论(0) 推荐(0)

986. Interval List Intersections

摘要： Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order. Return the intersection of these two interval li 阅读全文

posted @ 2019-07-15 09:03 北叶青藤阅读(373) 评论(0) 推荐(0)

Design Search Autocomplete System

摘要： Design a search autocomplete system for a search engine. Users may input a sentence (at least one word and end with a special character '#'). For each 阅读全文

posted @ 2019-07-15 05:34 北叶青藤阅读(523) 评论(0) 推荐(0)

973. K Closest Points to Origin

摘要： We have a list of points on the plane. Find the K closest points to the origin (0, 0). (Here, the distance between two points on a plane is the Euclid 阅读全文

posted @ 2019-07-15 02:03 北叶青藤阅读(359) 评论(0) 推荐(0)

公告