• LeetCode-Young
  • 综合
    • 1
    • HashMap VS BST
    • Advantages of Trie Data Structure
    • Trie
    • Lambda Expression
    • 树和图
    • 栈和队列
    • 数组与字符串
    • 链表
    • 位操作
    • 智力题
    • 数学和概率
    • 递归和动态规划
    • 排序和查找
    • Catalan Number
    • 中等难题
    • 高难度题
    • Iterator
    • DP
    • L1
    • L2
    • L3
  • Introduction
  • Multithreading in Java
    • General
  • Stack
    • 155 Min Stack
    • 232-Implement Queue using Stacks
    • 42-Trapping Rain Water
    • 84 Largest Rectangle in Histogram
    • 85 Maximal Rectangle
    • 394 Decode String
    • 32 Longest Valid Parentheses
    • 255 Verify Preorder Sequence in Binary Search Tree
    • 144 Binary Tree Preorder Traversal
    • 739 Daily Temperatures
    • 496 Next Greater Element I
    • 503 Next Greater Element II
    • 439 Ternary Expression Parser
  • Queue
    • 621-Task Scheduler
    • 582-Kill Process
    • 353-Design Snake Game
    • 346-Moving Average from Data Stream
    • 363-Max Sum of Rectangle No Larger Than K
    • 102 Binary Tree Level Order Traversal
    • 378 Kth Smallest Element in a Sorted Matrix
  • Map
    • 560-Subarray Sum Equals K
    • 438 Find All Anagrams in a String
    • 347 - Top K Frequent Elements
    • 242 Valid Anagram
    • 387 First Unique Character in a String
    • 454 4Sum II
    • 166 Fraction to Recurring Decimal
  • String
    • 647 Palindromic Substrings
    • 49 Group Anagrams
    • 301 Remove Invalid Parentheses
    • 76 Minimum Window Substring
    • 159 Longest Substring with At Most Two Distinct Characters
    • 179 Largest Number
    • Substring problems
    • 38 Count and Say
    • 556 Next Greater Element III
    • 186 Reverse Words in a String II
    • 161 One Edit Distance
    • 544 Output Contest Matches
    • 227 Basic Calculator II
    • 127 Word Ladder
    • 678 Valid Parenthesis String
    • 43 Multiply Strings
    • 151 Reverse Words in a String
    • 205 Isomorphic Strings
    • 93 Restore IP Addresses
    • 65 Valid Number
    • 555 Split Concatenated Strings
  • Array
    • 53-Maximum Subarray
    • 581 Shortest Unsorted Continuous Subarray
    • 240 Search a 2D Matrix II
    • 350 Intersection of Two Arrays II
    • 287 Find the Duplicate Number
    • 142 Linked List Cycle II
    • 163 Missing Ranges
    • 548 Split Array with Equal Sum
    • 164 Maximum Gap
  • Tree
    • 100-Same Tree
    • 101-Symmetric Tree
    • 104-Maximum Depth of Binary Tree
    • 617-Merge Two Binary Trees
    • 226-Invert Binary Tree
    • 543-Diameter of Binary Tree
    • 437 Path Sum III
    • 112 Path Sum
    • 113 Path Sum II
    • 572 Subtree of Another Tree
    • 538 Convert BST to Greater Tree
    • 94 Binary Tree Inorder Traversal
    • 337 House Robber III
    • 236 Lowest Common Ancestor of a Binary Tree
    • 98 Validate Binary Search Tree
    • 230 Kth Smallest Element in a BST
    • 114 Flatten Binary Tree to Linked List
    • 124 Binary Tree Maximum Path Sum
    • 315 Count of Smaller Numbers After Self
    • 235 Lowest Common Ancestor of a Binary Search Tree
    • 606 Construct String from Binary Tree
    • 545 Boundary of Binary Tree
    • 742 Closest Leaf in a Binary Tree
    • 663 Equal Tree Partition
    • 285 Inorder Successor in BST
    • 103 Binary Tree Zigzag Level Order Traversal
    • 536 Construct Binary Tree from String
    • 450 Delete Node in a BST
    • 666 Path Sum IV
    • 156 Binary Tree Upside Down
    • 107 Binary Tree Level Order Traversal II
    • 109 Convert Sorted List to Binary Search Tree
  • Linked List
    • 21-Merge Two Sorted Lists
    • 206-Reverse Linked List
    • 141-Linked List Cycle
    • 148 Sort List
    • 234 Palindrome Linked List
    • 160 Intersection of Two Linked Lists
    • 23 Merge k Sorted Lists
    • 138 Copy List with Random Pointer
    • 24 Swap Nodes in Pairs
    • 92 Reverse Linked List II
    • 86 Partition List
    • 61 Rotate List
    • 82 Remove Duplicates from Sorted List II
    • 147 Insertion Sort List
    • 143 Reorder List
  • Bit Manipulation
    • 136-Single Number
    • 461-Hamming Distance
    • 191 Number of 1 Bits
    • 190 Reverse Bits
    • 371 Sum of Two Integers
    • 89 Gray Code
    • 476 Number Complement
    • 29 Divide Two Integers
    • 137 Single Number II
    • 260 Single Number III
    • 421 Maximum XOR of Two Numbers in an Array
  • Brainteaser
    • 292-Nim Game
    • 699 Falling Squares
  • Design
    • 146-LRU Cache
    • 208 Implement Trie (Prefix Tree)
    • 297 Serialize and Deserialize Binary Tree
    • 384 Shuffle an Array
    • 535 Encode and Decode TinyURL
    • 295 Find Median from Data Stream
  • DP
    • 64 Minimum Path Sum
    • 72 Edit Distance
    • 312 Burst Balloons
    • 309 Best Time to Buy and Sell Stock with Cooldown
    • 746 Min Cost Climbing Stairs
    • 264 Ugly Number II
    • 313 Super Ugly Number
    • 403 Frog Jump
    • 651 4 Keys Keyboard
    • 516 Longest Palindromic Subsequence
    • 304 Range Sum Query 2D - Immutable
    • 115 Distinct Subsequences
    • Best Time to Buy and Sell Stock
  • Graph
    • 547 Friend Circles
    • 200 Number of Islands
    • 207 Course Schedule
    • 694 Number of Distinct Islands
    • 711 Number of Distinct Islands II
    • 133 Clone Graph
    • 269 Alien Dictionary
    • 332 Reconstruct Itinerary
    • 399 Evaluate Division
    • 210 Course Schedule II
    • 323 Number of Connected Components in an Undirected Graph
    • 261 Graph Valid Tree
    • 310 Minimum Height Trees
    • 444 Sequence Reconstruction
    • 743 Network Delay Time
    • 684 Redundant Connection
    • 685 Redundant Connection II
  • BackTrack
    • 22 Generate Parentheses
    • 51 N-Queens
  • Greedy
    • 406 Queue Reconstruction by Height
    • 134 Gas Station
    • 334 Increasing Triplet Subsequence
    • 738 Monotone Increasing Digits
    • 759 Employee Free Time
    • 484 Find Permutation
    • 44 Wildcard Matching
    • 714 Best Time to Buy and Sell Stock with Transaction Fee
  • Math
    • 172 Factorial Trailing Zeroes
    • 625 Minimum Factorization
    • 246 Strobogrammatic Number
    • 247 Strobogrammatic Number II
    • 750 Number Of Corner Rectangles
    • 60 Permutation Sequence
  • 645 Set Mismatch
  • Heap
    • 218 The Skyline Problem
    • 692 Top K Frequent Words
    • 373 Find K Pairs with Smallest Sums
    • 215 Kth Largest Element in an Array
    • 253 Meeting Rooms II
  • Search
    • 329 Longest Increasing Path in a Matrix
    • 130 Surrounded Regions
    • 153 Find Minimum in Rotated Sorted Array
    • 140 Word Break II
    • 540 Single Element in a Sorted Array
  • Reservoir Sampling
    • 382 Linked List Random Node
    • 398 Random Pick Index
    • Reservoir Sampling
  • Union Find
    • 737 Sentence Similarity II
    • 721 Accounts Merge
    • 305 Number of Islands II
  • Trie
    • 648 Replace Words
    • 211 Add and Search Word - Data structure design
  • Geometry
    • 149 Max Points on a Line
  • HXSB
    • HX really sb
  • Sort
    • 75 Sort Colors
    • 280 Wiggle Sort
    • 324 Wiggle Sort II
  • Math
  • Backtrack
    • 77 Combinations
    • 526 Beautiful Arrangement
    • *Imp_39. Combination Sum
    • 78 Subsets
    • 320 Generalized Abbreviation
    • 37 Sudoku Solver
    • 291 Word Pattern II
    • 698 Partition to K Equal Sum Subsets
  • Backtracking
  • Design
  • 173 Binary Search Tree Iterator
  • 341 Flatten Nested List Iterator
  • 284 Peeking Iterator
  • 251 Flatten 2D Vector
  • 348 Design Tic-Tac-Toe
  • 170 Two Sum III - Data structure design
Powered by GitBook

115 Distinct Subsequences

115.Distinct Subsequences

http://bangbingsyb.blogspot.com/2014/11/leetcode-distinct-subsequences.html

https://leetcode.com/problems/distinct-subsequences/discuss/37412/Any-better-solution-that-takes-less-than-O(n2)-space-while-in-O(n2)-time

https://leetcode.com/problems/distinct-subsequences/discuss/37327/Easy-to-understand-DP-in-Java

results matching ""

    No results matching ""