frankming

摘要： 题目 Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1 and return them in any o 阅读全文

摘要： 题目 Given an m x n matrix board containing 'X' and 'O', capture all regions that are 4-directionally surrounded by 'X'. A region is captured by flippin 阅读全文

摘要： 题目 Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path i 阅读全文

摘要： 题目 Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot 阅读全文

摘要： 题目 Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If th 阅读全文

摘要： 题目 There are n cities. Some of them are connected, while some are not. If city a is connected directly with city b, and city b is connected directly w 阅读全文

摘要： 题目 Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by 阅读全文

摘要： 题目 Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, ..., nu 阅读全文

摘要： 题目 Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray i 阅读全文

摘要： 题目 Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. An Anagram is a w 阅读全文