随笔分类 - LeetCode
摘要：Find Duplicate File in System (M) 题目 Given a list paths of directory info, including the directory path, and all the files with contents in this direc
阅读全文
摘要：Longest String Chain (M) 题目 Given a list of words, each word consists of English lowercase letters. Let's say word1 is a predecessor of word2 if and o
阅读全文
摘要：Binary Tree Cameras (H) 题目 Given a binary tree, we install cameras on the nodes of the tree. Each camera at a node can monitor its parent, itself, and
阅读全文
摘要：Valid Number (H) 题目 Validate if a given string can be interpreted as a decimal number. Some examples: "0" ⇒ true " 0.1 " ⇒ true "abc" ⇒ false "1 a" ⇒
阅读全文
摘要：Flatten Binary Tree to Linked List (M) 题目 Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5
阅读全文
摘要：Ambiguous Coordinates (M) 题目 We had some 2-dimensional coordinates, like "(1, 3)" or "(2, 0.5)". Then, we removed all commas, decimal points, and spac
阅读全文
摘要：Maximum Points You Can Obtain from Cards (M) 题目 There are several cards arranged in a row, and each card has an associated number of points The points
阅读全文
摘要：Count Primes (E) 题目 Count the number of prime numbers less than a non-negative number, n. Example: Input: 10 Output: 4 Explanation: There are 4 prime
阅读全文
摘要：Construct Target Array With Multiple Sums (H) 题目 Given an array of integers target. From a starting array, A consisting of all 1's, you may perform th
阅读全文
摘要：Super Palindromes (H) 题目 Let's say a positive integer is a super-palindrome if it is a palindrome, and it is also the square of a palindrome. Given tw
阅读全文
摘要：Delete Operation for Two Strings (M) 题目 Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the sam
阅读全文
摘要：Convert Sorted List to Binary Search Tree (M) 题目 Given a singly linked list where elements are sorted in ascending order, convert it to a height balan
阅读全文
摘要：Non-decreasing Array (M) 题目 Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one elem
阅读全文
摘要：Running Sum of 1d Array (E) 题目 Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running su
阅读全文
摘要：Course Schedule III (H) There are n different online courses numbered from 1 to n. You are given an array courses where courses[i] = [durationi, lastD
阅读全文
摘要：Prefix and Suffix Search (H) 题目 Design a special dictionary which has some words and allows you to search the words in it by a prefix and a suffix. Im
阅读全文
摘要：Powerful Integers (M) 题目 Given three integers x, y, and bound, return a list of all the powerful integers that have a value less than or equal to boun
阅读全文
摘要：Power of Three (E) 题目 Given an integer n, return true if it is a power of three. Otherwise, return false. An integer n is a power of three, if there e
阅读全文
摘要：Furthest Building You Can Reach (M) 题目 You are given an integer array heights representing the heights of buildings, some bricks, and some ladders. Yo
阅读全文
摘要：Critical Connections in a Network (H) 题目 There are n servers numbered from 0 to n-1 connected by undirected server-to-server connections forming a net
阅读全文
浙公网安备 33010602011771号