ACM-双指针
文章平均质量分 59
LarryNLPIR
专注NLP/IR/Machine Learning/Data Mining
展开
-
LeetCode 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原创 2014-11-16 10:37:08 · 2540 阅读 · 1 评论 -
LeetCode Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The原创 2015-01-27 14:34:16 · 1652 阅读 · 0 评论 -
LeetCode Sort Colors (One Pass Solution)
LeetCode - Sort ColorsGiven an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will原创 2014-10-29 13:01:46 · 3233 阅读 · 0 评论 -
LeetCode Linked List Cycle
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?思路分析:这题很简单,直接用快慢指针法就可以解决,快指针速度是慢指针速度的2倍,如果有环,它们一定会相遇。AC Code/** * Definition for singly-lin原创 2015-01-19 14:47:40 · 1300 阅读 · 0 评论 -
LeetCode Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its ne原创 2014-11-10 14:01:07 · 1868 阅读 · 0 评论 -
LeetCode - Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For原创 2015-02-03 06:29:35 · 1971 阅读 · 1 评论 -
LeetCode Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘ c原创 2015-01-05 07:33:08 · 2941 阅读 · 0 评论 -
LeetCode Missing Ranges [LeetCode Book Problem]
Given a sorted integer array where the range of elements are [lower, upper] inclusive, return its missing ranges.For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, return ["2", "4->49", "原创 2015-06-15 12:59:49 · 3203 阅读 · 0 评论