IncredibleThings

LeetCode - Unique Binary Search Trees II

摘要： Given an integer n, return all the structurally unique BST's (binary search trees), which has exactly n nodes of unique values from 1 to n. Return the 阅读全文

posted @ 2021-02-20 15:18 IncredibleThings 阅读(36) 评论(0) 推荐(0) 编辑

LeetCode - Unique Binary Search Trees

摘要： Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n. Examp 阅读全文

posted @ 2021-02-19 16:02 IncredibleThings 阅读(28) 评论(0) 推荐(0) 编辑

LeetCode - 2 Keys Keyboard

摘要： Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step: Copy All: You can copy all the 阅读全文

posted @ 2021-02-17 16:06 IncredibleThings 阅读(31) 评论(0) 推荐(0) 编辑

LeetCode - Is Subsequence

摘要： Given two strings s and t, check if s is a subsequence of t. A subsequence of a string is a new string that is formed from the original string by dele 阅读全文

posted @ 2021-02-17 16:05 IncredibleThings 阅读(14) 评论(0) 推荐(0) 编辑

LeetCode - Min Cost Climbing Stairs

摘要： On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y 阅读全文

posted @ 2021-02-16 15:40 IncredibleThings 阅读(55) 评论(0) 推荐(0) 编辑

LeetCode - Design Add and Search Words Data Structure

摘要： Design a data structure that supports adding new words and finding if a string matches any previously added string. Implement the WordDictionary class 阅读全文

posted @ 2021-02-15 15:44 IncredibleThings 阅读(45) 评论(0) 推荐(0) 编辑

LeetCode - Implement Trie (Prefix Tree)

摘要： Implement a trie with insert, search, and startsWith methods. Example: Trie trie = new Trie(); trie.insert("apple"); trie.search("apple"); // returns 阅读全文

posted @ 2021-02-14 14:34 IncredibleThings 阅读(50) 评论(0) 推荐(0) 编辑

LeetCode - Merge Intervals

摘要： Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals 阅读全文

posted @ 2021-02-12 16:02 IncredibleThings 阅读(52) 评论(0) 推荐(0) 编辑

LeetCode - Jump Game

摘要： Given an array of non-negative integers nums, you are initially positioned at the first index of the array. Each element in the array represents your 阅读全文

posted @ 2021-02-11 15:38 IncredibleThings 阅读(41) 评论(0) 推荐(0) 编辑

LeetCode - Next Permutation

摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such an arrangement is not pos 阅读全文

posted @ 2021-02-11 14:47 IncredibleThings 阅读(40) 评论(0) 推荐(0) 编辑

导航

公告