mrlonelyjtr's blog

写BUG的程序猿


  • Home

  • Categories

  • Archives

  • Tags

  • Search

[LeetCode] Problem 56 - Merge Intervals

Posted on 2019-03-21 | In Algorithm , LeetCode
Given a collection of intervals, merge all overlapping intervals. ExampleNo.1Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explan ...
Read more »

[LintCode] Problem 917 - Palindrome Permutation II

Posted on 2019-03-20 | In Algorithm , LintCode
Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form ...
Read more »

[LintCode] Problem 916 - Palindrome Permutation

Posted on 2019-03-18 | In Algorithm , LintCode
Given a string, determine if a permutation of the string could form a palindrome. ExampleNo.1Input: s = “code” Output: False Explanation:No solution N ...
Read more »

[LintCode] Problem 642 - Moving Average from Data Stream

Posted on 2019-03-18 | In Algorithm , LintCode
Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window. ExampleMovingAverage m = new MovingA ...
Read more »

[LintCode] Problem 813 - Find Anagram Mappings

Posted on 2019-03-17 | In Algorithm , LintCode
Given two lists A and B, and B is an anagram of A. B is an anagram of A means B is made by randomizing the order of the elements in A. We want to find ...
Read more »

[LintCode] Problem 629 - Minimum Spanning Tree

Posted on 2019-03-16 | In Algorithm , LintCode
Given a list of Connections, which is the Connection class (the city name at both ends of the edge and a cost between them), find some edges, connect ...
Read more »

[LintCode] Problem 919 - Meeting Rooms II

Posted on 2019-03-16 | In Algorithm , LintCode
Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), find the minimum number of conference roo ...
Read more »

[LintCode] Problem 920 - Meeting Rooms

Posted on 2019-03-14 | In Algorithm , LintCode
Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), determine if a person could attend all me ...
Read more »

[LintCode] Problem 630 - Knight Shortest Path II

Posted on 2019-03-14 | In Algorithm , LintCode
Given a knight in a chessboard n * m (a binary matrix with 0 as empty and 1 as barrier). the knight initialze position is (0, 0) and he wants to reach ...
Read more »

[LintCode] Problem 611 - Knight Shortest Path

Posted on 2019-03-13 | In Algorithm , LintCode
Given a knight in a chessboard (a binary matrix with 0 as empty and 1 as barrier) with a source position, find the shortest path to a destination posi ...
Read more »
1…535455…78
mrlonelyjtr

mrlonelyjtr

间歇性踌躇满志,持续性混吃等死

780 posts
18 categories
18 tags
Github
© 2020 mrlonelyjtr
Powered by Hexo
Theme - NexT.Pisces