# two-pointers

2/4ページ

## [LintCode/LeetCode] Minimum Window Substring

Problem Given a string source and a string target, find the minimum window in source which will contain all the characters in target. Notice If there […]

## [LintCode] Move Zeroes

Problem Given 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. No […]

## [LeetCode] Reverse Vowels of a String

Problem Write a function that takes a string as input and reverse only the vowels of a string. Example 1:Given s = "hello", return "holle" 2. StringBu […]

## [LeetCode] Longest Substring Without Repeating Characters

Problem Given a string, find the length of the longest substring without repeating characters. Examples: Given “abcabcbb”, the answer is & […]

## [LintCode/LeetCode] Intersection of Two Arrays I & II [BitSet]

Problem Given two arrays, write a function to compute their intersection. Notice Each element in the result must be unique.The result can be in any or […]

## 【LC總結】K Sum (Two Sum I II/3Sum/4Sum/3Sum Closest)

Two Sum Problem Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indi […]

## 【LC總結】KMP * Implement Strstr

Implement strStr() Problem Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystac […]

## [Leetcode] Two Sum, 3Sum,4Sum,4SumII,3Sum Closet

Two SumGiven 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 […]