Array

ProblemGiven an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the maximum number of points that lie on the same straight line. Example 1: !https://assets.leetcode.com/uploads/2021/02/25/plane1.jpg 123Input: points = [[1,1],[2,2],[3,3]]Output: 3 Example 2: !https://assets.leetcode.com/uploads/2021/02/25/plane2.jpg 123Input: points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]Output: 4 Constraints: 1 <= points.length <= 300 points[i].length == 2 10^4 & ...

ProblemGiven an m x n binary matrix filled with 0‘s and 1‘s, find the largest square containing only 1‘s and return its area. Example 1: !https://assets.leetcode.com/uploads/2020/11/26/max1grid.jpg 123Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0& ...

進階leetcode212 ProblemGiven an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once. Example 1: !https://assets.leetcode.com/uploads/2020/11/04/word2.jpg 123Input: board = [["A","B","C","E"],["S","F","C" ...

簡易leetcode79 ProblemGiven an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word. Example 1: !https://assets.leetcode.com/uploads/2020/11/07/search1.jpg 123Input: board = [["o","a","a","n"],["e","t",&quo ...

ProblemGiven a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with O(log n) runtime complexity. Example 1: 123Input: nums = [1,3,5,6], target = 5Output: 2 Example 2: 123Input: nums = [1,3,5,6], target = 2Output: 1 Example 3: 123Input: nums = [1,3,5,6], target = 7Output: 4 Constraints: 1 <= nums.length <= 10^4 10^4 <= nums[i] <= 10^4 ...

leetcode62 ProblemGiven a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row. Example 1: 123456789Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]Output: 11Explanation: The triangle looks like: 2 3 4 6 5 74 1 8 3The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above). Exa ...

可以先看看leetcode70 ProblemYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night. Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without ...

ProblemYou are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Example 1: 12345Input: prices = [7,1,5,3,6,4]Output: 5Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.Note that buyi ...

ProblemGiven a n * n matrix grid of 0's and 1's only. We want to represent grid with a Quad-Tree. Return the root of the Quad-Tree representing grid. A Quad-Tree is a tree data structure in which each internal node has exactly four children. Besides, each node has two attributes: val: True if the node represents a grid of 1’s or False if the node represents a grid of 0’s. Notice that you can assign the val to True or False when isLeaf is False, and both are accepted in the answer. isLea ...

#ProblemGiven an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val. Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things: Change the array nums such that the first k elements of nums contain the elements which are not equal to val. The remaining elements of nums are not import ...