Leetcode
文章平均质量分 64
小杨快没头发了
去年开始转入计算机专业领域,还有很多东西要学。
最近开始搭建自己的个人博客,将会不断把日常刷题题解以及以往开发项目及学习笔记上传,持续更新。希望感兴趣的可以关注一下~
展开
-
leetcode-20. Valid Parentheses 有效的括号 (C) 华为一面
leetcode 20. Valid ParenthesesGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of brackets.Open brackets原创 2021-05-08 14:57:37 · 243 阅读 · 0 评论 -
力扣 206 -翻转链表
反转链表 206 4/20/2020Reverse Linked List - Easy地址: https://leetcode.com/problems/reverse-linked-list/题目描述Given the head of a singly linked list, reverse the list, and return the reversed list.Example 1:Input: head = [1,2,3,4,5]Output: [5,4,3,2,1]原创 2021-04-20 19:49:43 · 136 阅读 · 0 评论 -
力扣704 - Binary Search 二分查找
力扣704 - Binary Search 二分查找题目描述Given 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.Example 1:Input: nums = [原创 2021-04-14 19:22:35 · 146 阅读 · 0 评论 -
力扣 62. Unique Paths-不同路径-二维方向上到达某点的路径数(Python版本)
力扣 62. Unique Paths-不同路径(Python版本)题目描述A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corne原创 2021-04-04 20:42:15 · 208 阅读 · 1 评论 -
力扣70. Climbing Stairs-爬楼梯-爬楼梯方案数 (Python)
力扣70. Climbing Stairs 爬楼梯题目描述You 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?假设你正在爬楼梯。需要 n 阶你才能到达楼顶。每次你可以爬 1 或 2 个台阶。你有多少种不同的方法可以爬到楼顶呢?Ex原创 2021-04-03 22:59:28 · 236 阅读 · 0 评论 -
力扣66. Plus One - 加一 (Python版本,两解题思路)
力扣66. 加一 (Python版本,两解题思路)题目描述Given a non-empty array of decimal digits representing a non-negative integer, increment one to the integer.The digits are stored such that the most significant digit is at the head of the list, and each element in the arra原创 2021-04-03 14:26:03 · 134 阅读 · 0 评论 -
力扣1. Two Sum 两数之和 (python)
Leetcode 1. Two Sum 两数之和 (python)题目Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same ele原创 2021-04-01 11:28:36 · 256 阅读 · 1 评论 -
力扣 160 - Intersection of Two Linked Lists. (相交链表) Python双指针
力扣 160 - Intersection of Two Linked Lists. (相交链表) Python双指针https://leetcode.com/problems/intersection-of-two-linked-lists/Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lis原创 2021-04-01 01:03:13 · 270 阅读 · 1 评论