leetcode
文章平均质量分 83
刷题记录
_Vivi__
这个作者很懒,什么都没留下…
展开
-
算法刷题--动态规划
Code 1 : climbing StairsYou are climbing a staircase. It takes n steps to reach the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Example 1Input: n = 2Output: 2Explanation: There are two ways to c原创 2021-09-20 21:02:26 · 169 阅读 · 0 评论 -
算法刷题--广度优先搜索 / 深度优先搜索
Code 1 : Flood FillAn image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image.You are also given three integers sr, sc, and newColor. You should perform a flood fill on the image starting from the pix原创 2021-09-12 15:35:34 · 212 阅读 · 0 评论 -
算法刷题--滑动窗口
CODE 1 :Longest Substring Without Repeating CharactersGiven a string s, find the length of the longest substring without repeating characters.Example 1Input: s = "abcabcbb"Output: 3Explanation: The answer is "abc", with the length of 3.Example 2:In原创 2021-09-09 19:11:17 · 123 阅读 · 0 评论 -
算法刷题--双指针
Code 1Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.Example 1Input: nums = [-4,-1,0,3,10]Output: [0,1,9,16,100]Explanation: After squaring, the array becomes [1原创 2021-09-05 17:08:50 · 224 阅读 · 0 评论 -
算法刷题--二分查找
Day 1Code 1 : Binary SearchGiven an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.You must write an algorithm wi原创 2021-09-03 10:06:54 · 137 阅读 · 0 评论 -
2021-08-23
Code 1QuestionYou are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.Notice that there ma原创 2021-08-23 21:53:48 · 77 阅读 · 0 评论 -
2021-08-21
Code 1QuestionGiven the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level).Example 1Input: root = [3,9,20,null,null,15,7]Output: [[3],[9,20],[15,7]]Example 2Input: root = [1]Out原创 2021-08-23 15:39:23 · 43 阅读 · 0 评论 -
2021-08-19
Code 1QuestionGiven the head of a singly linked list, reverse the list, and return the reversed list.Example 1Input: head = [1,2,3,4,5]Output: [5,4,3,2,1]Example 2Input: head = [1,2]Output: [2,1]Example 3Input: head = []Output: []Solution迭原创 2021-08-20 22:46:00 · 87 阅读 · 0 评论 -
2021-08-18
Code 1QuestionGiven a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1.Example 1Input: s = "leetcode"Output: 0Example 2Input: s = "loveleetcode"Output: 2Example 3Input: s = "aabb"Outp原创 2021-08-19 22:16:17 · 63 阅读 · 0 评论 -
2021-08-17
Code 1QuestionGiven a non-negative integer x, compute and return the square root of x.Since the return type is an integer, the decimal digits are truncated, and only the integer part of the result is returned.Note: You are not allowed to use any built-原创 2021-08-17 22:16:12 · 91 阅读 · 0 评论 -
2021-08-16
Code 1QuestionYou 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原创 2021-08-16 17:30:46 · 237 阅读 · 0 评论 -
2021-08-15
Code 1QuestionGiven an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.Example 1Input: nums = [1,2,3,1]Output: trueExample 2Input: nums = [1,2,3,4]Output: falseExamp原创 2021-08-16 15:03:57 · 107 阅读 · 0 评论 -
Leetcode Day1
Day1First code题目给定一个整数数组 nums 和一个整数目标值 target,请你在该数组中找出 和为目标值 target 的那 两个 整数,并返回它们的数组下标。你可以假设每种输入只会对应一个答案。但是,数组中同一个元素在答案里不能重复出现。你可以按任意顺序返回答案。示例 :输入:nums = [2,7,11,15], target = 9输出:[0,1]解释:因为 nums[0] + nums[1] == 9 ,返回 [0, 1原创 2021-07-23 12:58:44 · 103 阅读 · 0 评论