If no valid conversion could be performed, a zero value is returned. Note: Only the space character ' ' is considered as whitespace character. Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. If the ...
LeetCode Top Interview Questions https://leetcode.com/problemset/top-interview-questions/
LeetCode Top Interview Questions 130. Surrounded Regions (Java版; Medium) 题目描述 Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. Example: X X X X X ...
1、Two Sum 2、Add Two Numbers 3、Longest Substring Without Repeating Characters 4. Median of Two Sorted Arrays 5、Longest Palindromic Substring 11. Container With Most Water 15. 3Sum 16. 3Sum Closest 17. Letter Combinations of a Phone Number 19. Remove Nth Node From End of List 20. Valid ...
code .gitignore Top100.md TopInterview.md readme.md Repository files navigation README LeetCode 指南语言: Java 说明: 每道题在代码头部都添加了我的解题思路和批注,Eg: /*** * 287. Find the Duplicate Number * 题意:n+1个数属于[1~n],找出重复的那个数 * 难度:Medium * 分类:Array...
/LeetCodeAnimation Demonstrate all the questions on LeetCode in the form of animation.(用动画的形式呈现解LeetCode题目的思路) 45.4k Java 11/14 3 /mall mall项目是一套电商系统,包括前台商城系统及后台管理系统,基于SpringBoot+MyBatis实现。 前台系统包含首页门户、商品推荐、商品搜索、商品展示、购物车...
LeetCode Top Interview Questions 88. Merge Sorted Array (Java版; Easy) welcome to my blog LeetCode Top Interview Questions 88. Merge Sorted Array (Java版; Easy) 题目描述 第一次做; 最优解; 空间复杂度O(1); 有序数组, 往往可以考虑使用双指针; 其实归并过程就是双指针, 但是需要额外空间, ...
welcome to my blog LeetCode Top 100 Liked Questions 303. Range Sum Query - Immutable (Java版; Easy) 题目描述 Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Given nums = [-2, 0, 3, -5, 2, -1] ...
扫码登录更便捷 +86 获取验证码 登录/ 注册 帐号密码登录 已有美国站帐号 注册或登录即代表您同意《用户协议》和《隐私协议》
LeetCode Top Interview Questions 29. Divide Two Integers (Java版; Medium) 题目描述 Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return the quotient after dividing dividend by divisor. ...