leetcode
文章平均质量分 69
Chris_zhangrx
读书郎
展开
-
[环境配置] vscode 配置 leetcode 插件
文章目录配置步骤可能会遇到的问题配置步骤Extension 商店搜索: leetcode,选择第一个下载量最高的下载就可以了安装完成后左侧就会多一个 leetcode 的图标栏点击上面的图标,会有 Sign in to LeetCode 字样上图中:红框标记的是选择中文还是 us 版的 leetcode 网站。黄框标记的是登录方式。若依赖没有问题直接选择相应的网站,登录自己的帐号就可以了。可能会遇到的问题这里需要的依赖是:VS Code 1.30.1+Node.原创 2021-12-28 14:53:31 · 3402 阅读 · 0 评论 -
344. Reverse String -- Python
344. Reverse StringWrite a function that takes a string as input and returns the string reversed.Example: Given s = “hello”, return “olleh”.代码:class Solution: def reverseString(self, s)原创 2018-01-17 22:43:14 · 327 阅读 · 0 评论 -
657. Judge Route Circle -- Python
657. Judge Route Circle Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.The move s原创 2018-01-17 21:00:46 · 635 阅读 · 0 评论 -
26. Remove Duplicates from Sorted Array -- Python
26. Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.Do not allocate extra space for anothe原创 2018-01-08 23:42:41 · 599 阅读 · 0 评论 -
643. Maximum Average Subarray I -- Python
643. Maximum Average Subarray IGiven an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average原创 2018-01-08 23:14:15 · 637 阅读 · 0 评论 -
53. Maximum Subarray -- Python
53. Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous su原创 2018-01-08 22:37:23 · 867 阅读 · 0 评论 -
35. Search Insert Position -- Python
35. Search Insert PositionGiven a sorted array 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 may assume n原创 2018-01-07 14:28:26 · 743 阅读 · 0 评论 -
119. Pascal's Triangle II -- Python
119. Pascal’s Triangle II Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].Note: Could you optimize your algorithm to use only O(k) extr原创 2018-01-15 16:55:33 · 422 阅读 · 0 评论 -
118. Pascal's Triangle -- Python
118. Pascal’s TriangleGiven numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return:[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]思路:原创 2018-01-15 16:47:46 · 545 阅读 · 0 评论 -
189. Rotate Array -- Python
189. Rotate ArrayRotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many so原创 2018-01-15 00:02:07 · 524 阅读 · 0 评论 -
532. K-diff Pairs in an Array -- Python
532. K-diff Pairs in an ArrayGiven an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), wh原创 2018-01-15 15:21:06 · 612 阅读 · 0 评论 -
557. Reverse Words in a String III -- Python
557. Reverse Words in a String III Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.Example 1:原创 2018-01-17 22:52:19 · 301 阅读 · 0 评论 -
747.Largest Number At Least Twice of Others -- Python
747.Largest Number At Least Twice of OthersIn a given integer array nums, there is always exactly one largest element.Find whether the largest element in the array is at least twice as much as eve原创 2018-01-17 23:48:43 · 679 阅读 · 0 评论 -
219. Contains Duplicate II -- Python
219. Contains Duplicate IIGiven an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference be原创 2018-01-09 22:38:51 · 464 阅读 · 0 评论 -
求平方根问题 (C++ 实现)
下面是用二分法和牛顿迭代法求一个正数的平方根。二分法这里的题目稍微宽了一点点,包含了整数和小数的情况,这里二分法就不用多说了,如果中间值的平方与目标值在误差范围内,则返回,否则根据大小情况改变左/右区间的端点。#include<iostream>using namespace std;int main(){ double eps = 1e-6; double k = 0...原创 2019-04-07 16:23:28 · 6068 阅读 · 0 评论 -
《面试算法 LeetCode 刷题班》——4. 递归,回溯,分治
本文内容是基于小象学院——林沐 《面试算法 LeetCode 刷题班》,后期仍将对相关内容进行不定期更新!4. 递归,回溯,分治文章目录4. 递归,回溯,分治LeetCode 78 求子级(M)LeetCode 90 求子集2(M)LeetCode 40 组合数之和2(M)LeetCode 22 生成括号(M)LeetCode 51 N 皇后(H)LeetCode 315 逆序数(H)Lee...原创 2018-11-28 11:06:45 · 2219 阅读 · 0 评论 -
《面试算法 LeetCode 刷题班》——6.二分查找与二叉查找树
本文内容是基于小象学院——林沐 《面试算法 LeetCode 刷题班》,后期仍将对相关内容进行不定期更新!6.二叉查找与二叉查找树文章目录6.二叉查找与二叉查找树LeetCode 35 插入位置LeetCode 34 查找区间LeetCode 33 旋转数组查找LeetCode 449LeetCode 315 逆序数 (解法2)二分查找的递归实现bool binary_search(v...原创 2018-11-28 11:01:37 · 628 阅读 · 0 评论 -
《面试算法 LeetCode 刷题班》——5.二叉树与图
本文内容是基于小象学院——林沐 《面试算法 LeetCode 刷题班》,后期仍将对相关内容进行不定期更新!5. 二叉树与图文章目录5. 二叉树与图leetCode 113 路径之和2LeetCode 236 最近的公共祖先LeetCode 114 二叉树转链表LeetCode 199 侧面观察二叉树LeetCode 207 课程安排leetCode 113 路径之和2这里题目已经事先定义了...原创 2018-11-28 10:59:27 · 1204 阅读 · 2 评论 -
《面试算法 LeetCode 刷题班》——9. 动态规划
本文内容是基于小象学院——林沐 《面试算法 LeetCode 刷题班》,后期仍将对相关内容进行不定期更新!9. 动态规划文章目录9. 动态规划LeetCode 70 爬楼梯 (E)LeetCode 198 打家劫舍 (E)LeetCode 53 最大子段和(E)LeetCode 322 找零钱(M)LeetCode 120 三角形(M)LeetCode 300 最长上升子序列LeetCode ...原创 2018-11-27 23:08:24 · 2039 阅读 · 0 评论 -
《面试算法 LeetCode 刷题班》——7. 哈希表与字符串
本文内容是基于小象学院——林沐 《面试算法 LeetCode 刷题班》,后期仍将对相关内容进行不定期更新!7. 哈希表与字符串文章目录7. 哈希表与字符串LeetCode 409 最长回文串(E)LeetCode 290 词语模式(E)LeetCode 49 同字符词语分组(M)LeetCode 3 无重复字符的最长字串(M)LeetCode 187 重复的 DNA 序列(M)LeetCode...原创 2018-11-27 23:03:56 · 720 阅读 · 0 评论 -
《面试算法 LeetCode 刷题班》——8. 搜索
本文内容是基于小象学院——林沐 《面试算法 LeetCode 刷题班》,后期仍将对相关内容进行不定期更新!8.搜索文章目录8.搜索LeetCode 200 岛屿数量(M)LeetCode 127 词语阶梯 (M)LeetCode 126 词语阶梯2(H)LeetCode 473 火柴棍摆正方形LeetCode 407 收集雨水2 (H)LeetCode 200 岛屿数量(M)问题描述:用...原创 2018-11-27 22:59:34 · 1716 阅读 · 3 评论 -
《面试算法 LeetCode 刷题班》——2. 栈、队列、堆
本文内容是基于小象学院——林沐 《面试算法 LeetCode 刷题班》2. 栈、队列、堆文章目录2. 栈、队列、堆LeetCode 225 使用队列(Q)实现栈(S) (E)LeetCode 232 用栈实现队列(E)LeetCode 155 Min Stack(E)Poj 1363 合法的出栈序列(M)LeetCode 215 第K个最大的元素(E)LeetCode 295 寻找中位数(H)...原创 2018-11-27 22:49:38 · 2772 阅读 · 3 评论 -
《面试算法 LeetCode 刷题班》—— 1. 链表
本文内容是基于小象学院——林沐 《面试算法 LeetCode 刷题班》,后期仍将对相关内容进行不定期更新!1.链表文章目录1.链表LeetCode 206 链表逆序 a (E)LeetCode 92 链表逆序 b(M)LeetCode 141 &amp; 142 链表求环(M) (快慢指针问题)LeetCode 86 链表划分(M)LeetCode 21 排序链表合并(2个)(E)LeetCo...原创 2018-12-04 19:51:58 · 3081 阅读 · 1 评论 -
88. Merge Sorted Array -- Python
88. Merge Sorted ArrayGiven two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal t原创 2018-01-09 22:55:20 · 368 阅读 · 0 评论 -
665. Non-decreasing Array -- Python
665. Non-decreasing ArrayGiven an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.We define an array is non-decreasing if array[i] E原创 2018-01-15 14:11:08 · 905 阅读 · 0 评论 -
Leetcode刷题汇总(Easy篇) -- Python
Easy篇Array 专题561 Array Partition I | 66.5% Easy 566 Reshape the Matrix 58.0% Easy 485 Max Consecutive Ones 53.9% Easy 695 Max Area原创 2018-01-17 23:34:32 · 4334 阅读 · 0 评论 -
557. Reverse Words in a String III -- Python
557. Reverse Words in a String IIIGiven a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.Example 1:原创 2018-01-22 22:32:48 · 581 阅读 · 0 评论 -
448. Find All Numbers Disappeared in an Array -- Python
448. Find All Numbers Disappeared in an ArrayGiven an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusi原创 2017-12-29 00:58:58 · 759 阅读 · 0 评论 -
283. Move Zeroes -- Python
283. Move ZeroesGiven an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after ca原创 2017-12-29 00:54:13 · 590 阅读 · 0 评论 -
217. Contains Duplicate--Python
217. Contains DuplicateGiven an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should ret原创 2018-01-03 16:37:32 · 691 阅读 · 0 评论 -
485.Max Consecutive Ones--Python
刚开始学习Python编程,欢迎交流学习!!485.Max Consecutive OnesGiven a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or原创 2017-12-27 21:33:00 · 533 阅读 · 0 评论 -
566.Reshape the Matrix--Python
刚开始学习Python编程,欢迎交流学习!!566.Reshape the MatrixIn MATLAB, there is a very useful function called ‘reshape’, which can reshape a matrix into a new one with different size but keep its original data.You’re原创 2017-12-27 21:29:20 · 705 阅读 · 0 评论 -
561.Array Partition I--Python
刚开始学习Python编程,欢迎交流学习!561.Array Partition IGiven an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi)原创 2017-12-27 21:20:03 · 1258 阅读 · 0 评论 -
695.Max Area of Island-Python
刚开始学习Python编程,欢迎交流学习!695.Max Area of Island思路:涉及到数组的题目大部分都需要遍历,然后二维数组的话更加麻烦,所以在此类问题中为了更有效的解决问题(避免重复遍历),可以考虑使用递归的方法来解决。根据题目条件,满足条件的 “1”的位置可以顺藤摸瓜,依次遍历上下左右 4 个方向,若有 “1” 则计数加一,重点是已经遍历过为“1”的点,在计数后需要将其变为 “0”原创 2017-12-27 21:11:59 · 774 阅读 · 0 评论 -
697. Degree of an Array--Python
697. Degree of an ArrayGiven a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.Your task is to find the smallest p原创 2018-01-02 19:56:33 · 1078 阅读 · 0 评论 -
717. 1-bit and 2-bit Characters--Python
717. 1-bit and 2-bit CharactersWe have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).Now given a string rep原创 2018-01-02 17:44:45 · 634 阅读 · 0 评论 -
169. Majority Element--Python
169. Majority ElementGiven an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the maj原创 2018-01-02 00:02:35 · 474 阅读 · 0 评论 -
628. Maximum Product of Three Numbers-- Python
628. Maximum Product of Three NumbersGiven an integer array, find three numbers whose product is maximum and output the maximum product.Example 1:Input: [1,2,3]Output: 6Example 2:Input:原创 2018-01-04 20:56:48 · 749 阅读 · 0 评论 -
268. Missing Number -- Python
268. Missing NumberGiven an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.Example 1Input: [3,0,1]Output: 2Example 2Input: [9,6,4,2,3,5,7,0,1原创 2018-01-04 21:23:26 · 575 阅读 · 0 评论 -
674. Longest Continuous Increasing Subsequence -- Python
674. Longest Continuous Increasing SubsequenceGiven an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).Example 1:Input: [1,3,5,4,7]Output: 3Explana原创 2018-01-04 21:51:20 · 618 阅读 · 0 评论