LeetCode | OJ
壹言
人生碌碌,竞短论长,却不道荣枯有数,得失难量。
展开
-
Two Sum
问题描述: Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not原创 2017-02-28 16:33:30 · 350 阅读 · 0 评论 -
Add Two Numbers
问题描述: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers a原创 2017-02-28 18:38:19 · 582 阅读 · 0 评论 -
Longest Substring Without Repeating Characters
问题描述: Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the原创 2017-03-07 20:26:56 · 292 阅读 · 0 评论 -
美团CodeM 资格赛第一题
美团外卖的品牌代言人袋鼠先生最近正在进行音乐研究。他有两段音频,每段音频是一个表示音高的序列。现在袋鼠先生想要在第二段音频中找出与第一段音频最相近的部分。 具体地说,就是在第二段音频中找到一个长度和第一段音频相等且是连续的子序列,使得它们的 difference 最小。两段等长音频的 difference 定义为: difference = SUM(a[i] - b[i])2 (1 ≤ i原创 2017-06-17 12:14:43 · 651 阅读 · 0 评论 -
割草机
题目描述 有一块n*m的地,每块地要么长满杂草(用'W'表示),要么是空地(用'G'表示),现在有一个人站在(1,1),面向(1,m),他可以按如下两种方式移动: 1、向面朝的方向移动一格,耗费1单位时间 2、向下移动一格,并反转面朝的方向(右变左,左变右),耗费1单位时间 现在他想知道清除所有的杂草最少需要多少单位时间(清除完杂草之后不用返回(1,1))原创 2017-11-24 22:38:06 · 618 阅读 · 0 评论 -
Reverse Integer
Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Output: 321 Example 2: Input: -123 Output: -321 Example 3: Input: 120 Output: 21 Note: Assume we are dealing wi...原创 2018-12-26 21:34:09 · 236 阅读 · 0 评论 -
Palindrome Number
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Input: 121 Output: true Example 2: Input: -121 Output: false Explanat...原创 2018-12-27 21:59:06 · 427 阅读 · 0 评论 -
Container With Most Water
Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two l...原创 2018-12-28 21:50:24 · 458 阅读 · 0 评论 -
Valid Parentheses
Given a string 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 br...原创 2018-12-25 21:50:15 · 199 阅读 · 0 评论