Leetcode - 随笔分类(第8页) - neverlandly

Leetcode: Most Stones Removed with Same Row or Column

摘要：If stone a and stone b are in the same column/row, we connect them as a component The largest possible number of moves we can make = the number of uni 阅读全文

posted @ 2019-10-12 15:03 neverlandly 阅读(194) 评论(0) 推荐(0)

Leetcode: Minimum Area Rectangle

只有注册用户登录后才能阅读该文。

posted @ 2019-10-12 13:33 neverlandly 阅读(2) 评论(0) 推荐(0)

Leetcode: Find the Shortest Superstring

只有注册用户登录后才能阅读该文。

posted @ 2019-10-11 14:01 neverlandly 阅读(5) 评论(0) 推荐(0)

Leetcode: Network Delay Time

只有注册用户登录后才能阅读该文。

posted @ 2019-10-10 16:04 neverlandly 阅读(7) 评论(0) 推荐(0)

Leetcode: 24 Game

摘要：Backtracking: every time draw two cards, calculate the possible results, and add one result to the nextRound list. The nextRound list will have the re 阅读全文

posted @ 2019-10-10 14:10 neverlandly 阅读(194) 评论(0) 推荐(0)

Leetcode: Minimum Window Subsequence

只有注册用户登录后才能阅读该文。

posted @ 2019-10-10 10:33 neverlandly 阅读(2) 评论(0) 推荐(0)

Leetcode: Brace Expansion

只有注册用户登录后才能阅读该文。

posted @ 2019-10-09 15:52 neverlandly 阅读(3) 评论(0) 推荐(0)

Leetcode: Expressive Words

只有注册用户登录后才能阅读该文。

posted @ 2019-10-09 15:05 neverlandly 阅读(2) 评论(0) 推荐(0)

Leetcode: Race Car

只有注册用户登录后才能阅读该文。

posted @ 2019-10-09 13:53 neverlandly 阅读(3) 评论(0) 推荐(0)

Leetcode: Cat and Mouse

只有注册用户登录后才能阅读该文。

posted @ 2019-10-08 16:29 neverlandly 阅读(3) 评论(0) 推荐(0)

Leetcode: New 21 Game

只有注册用户登录后才能阅读该文。

posted @ 2019-10-07 14:44 neverlandly 阅读(3) 评论(0) 推荐(0)

Leetcode: String Transforms Into Another String

只有注册用户登录后才能阅读该文。

posted @ 2019-10-07 11:31 neverlandly 阅读(3) 评论(0) 推荐(0)

Leetcode: Design Search Autocomplete System

只有注册用户登录后才能阅读该文。

posted @ 2019-10-07 09:29 neverlandly 阅读(6) 评论(0) 推荐(0)

Leetcode: Capacity To Ship Packages Within D Days

摘要：Exactly the same with Split Array Largest Sum. Binary search or DP Binary Search 阅读全文

posted @ 2019-10-07 03:30 neverlandly 阅读(286) 评论(0) 推荐(0)

Leetcode: Stream of Characters

摘要：Store the words in the trie with reverse order, and check the query string from the end 阅读全文

posted @ 2019-10-06 16:38 neverlandly 阅读(359) 评论(0) 推荐(0)

Leetcode: Backspace String Compare

摘要：Complexity Analysis Time Complexity: O(M + N)O(M+N), where M, NM,N are the lengths of S and T respectively. Space Complexity: O(1)O(1). Time Complexit 阅读全文

posted @ 2019-10-06 09:58 neverlandly 阅读(131) 评论(0) 推荐(0)

Leetcode: Compare Strings by Frequency of the Smallest Character

只有注册用户登录后才能阅读该文。

posted @ 2019-10-03 15:28 neverlandly 阅读(2) 评论(0) 推荐(0)

Leetcode: Shortest Way to Form String

摘要：Greedy Use two pointers, one for source: i, one for target: j. While j scan through target, try to match each char of j in source by moving i. Count h 阅读全文

posted @ 2019-10-03 14:16 neverlandly 阅读(1228) 评论(0) 推荐(1)

Leetcode: License Key Formatting

只有注册用户登录后才能阅读该文。

posted @ 2019-10-03 12:54 neverlandly 阅读(4) 评论(0) 推荐(0)

Leetcode: Campus Bikes II

摘要：Basic: Backtracking + pruning DP: refer to https://leetcode.com/problems/campus-bikes-ii/discuss/305218/DFS-%2B-Pruning-And-DP-Solution state : dp[i][ 阅读全文

posted @ 2019-10-02 16:13 neverlandly 阅读(1539) 评论(0) 推荐(0)

随笔分类 - Leetcode