CNoodle

摘要： There is a ball in a maze with empty spaces (represented as 0) and walls (represented as 1). The ball can go through the empty spaces by rolling up, d 阅读全文

摘要： There is a ball in a maze with empty spaces (represented as 0) and walls (represented as 1). The ball can go through the empty spaces by rolling up, d 阅读全文

摘要： We distribute some number of candies, to a row of n = num_people people in the following way: We then give 1 candy to the first person, 2 candies to t 阅读全文

摘要： Given the edges of a directed graph, and two nodes source and destination of this graph, determine whether or not all paths starting from source event 阅读全文

摘要： 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 ord 阅读全文

摘要： Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any two time points in the list. Examp 阅读全文

摘要： Let's play the minesweeper game (Wikipedia, online game)! You are given an m x n char matrix board representing the game board where: 'M' represents a 阅读全文

摘要： You are controlling a robot that is located somewhere in a room. The room is modeled as an m x n binary grid where 0 represents a wall and 1 represent 阅读全文

摘要： There is an m x n rectangular island that borders both the Pacific Ocean and Atlantic Ocean. The Pacific Ocean touches the island's left and top edges 阅读全文

摘要： Given an m x n integers matrix, return the length of the longest increasing path in matrix. From each cell, you can either move in four directions: le 阅读全文

摘要： Given a string s, return the number of substrings that have only one distinct letter. Example 1: Input: s = "aaaba" Output: 8 Explanation: The substri 阅读全文

摘要： Given a string s and an integer k, return the number of substrings in s of length k with no repeated characters. Example 1: Input: s = "havefunonleetc 阅读全文

摘要： Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloon 阅读全文

摘要： Given an unsorted array of integers nums, return the length of the longest continuous increasing subsequence (i.e. subarray). The subsequence must be  阅读全文

摘要： Given an integer array nums and an integer k, return the maximum length of a subarray that sums to k. If there is not one, return 0 instead. Example 1 阅读全文

摘要： You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array fruits where f 阅读全文

摘要： Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right 阅读全文

摘要： A valid number can be split up into these components (in order): A decimal number or an integer. (Optional) An 'e' or 'E', followed by an integer. A d 阅读全文

摘要： There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1. You are given a 2D array graph, where graph[u] is an array 阅读全文

摘要： Given two numbers, hour and minutes. Return the smaller angle (in degrees) formed between the hour and the minute hand. Example 1: Input: hour = 12, m 阅读全文