线性表
SYSU_xiandan
Life is like a dream.
展开
-
33. Search in Rotated Sorted Array
Problem:Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search.原创 2017-09-13 19:09:44 · 172 阅读 · 0 评论 -
80. Remove Duplicates from Sorted Array II
Problem:Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with th原创 2017-09-12 16:51:12 · 164 阅读 · 0 评论 -
135. Candy
Problem:There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have a原创 2017-09-28 18:48:57 · 205 阅读 · 0 评论 -
136. Single Number
Problem:Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it wit原创 2017-09-28 19:13:36 · 184 阅读 · 0 评论 -
31. Next Permutation
Problem:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowes原创 2017-09-20 19:47:08 · 196 阅读 · 0 评论 -
2. Add Two Numbers
Problem: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 number原创 2017-09-29 16:58:29 · 193 阅读 · 0 评论 -
206. Reverse Linked List
Problem:Reverse a singly linked list.题目就一行,翻转一个链表。所以题目也是比较简单,我用了递归的方法实现。Code:(LeetCode运行6ms)/** * Definition for singly-linked list. * struct ListNode { * int val; * List原创 2017-09-29 17:53:18 · 205 阅读 · 0 评论 -
92. Reverse Linked List II
Problem:Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m,原创 2017-09-29 18:49:43 · 138 阅读 · 0 评论 -
86. Partition List
Problem:Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the no原创 2017-09-30 16:43:42 · 167 阅读 · 0 评论 -
83. Remove Duplicates from Sorted List
Problem:iven a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.题意是删除链表中每个节点原创 2017-09-10 14:17:51 · 172 阅读 · 0 评论 -
61. Rotate List
Problem:Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.由题意得,给出一个链表和一个K原创 2017-10-01 11:57:21 · 144 阅读 · 0 评论 -
24. Swap Nodes in Pairs
Problem:Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constan原创 2017-10-02 15:32:25 · 211 阅读 · 0 评论 -
70. Climbing Stairs
Problem:You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will原创 2017-09-10 13:09:04 · 237 阅读 · 0 评论 -
26. Remove Duplicates from Sorted Array
Problem:Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in原创 2017-09-07 19:31:02 · 227 阅读 · 0 评论 -
3Sum Closest
Problem:Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would ha原创 2017-09-19 17:12:04 · 333 阅读 · 0 评论 -
81. Search in Rotated Sorted Array II
Problem:Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Write a function to determine if a give原创 2017-09-13 19:25:59 · 163 阅读 · 0 评论 -
4. Median of Two Sorted Arrays
Problem:There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:原创 2017-09-14 11:01:15 · 202 阅读 · 0 评论 -
60. Permutation Sequence
Problem:The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""13原创 2017-09-22 21:31:18 · 301 阅读 · 0 评论 -
36. Valid Sudoku
Problem:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A p原创 2017-09-23 16:01:09 · 188 阅读 · 0 评论 -
42. Trapping Rain Water
Problem:Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,原创 2017-09-24 13:44:44 · 203 阅读 · 0 评论 -
128. Longest Consecutive Sequence
Problem:Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence i原创 2017-09-16 11:34:26 · 192 阅读 · 0 评论 -
48. Rotate Image
Problem:You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note:You have to rotate the image in-place, which means you have to modify the原创 2017-09-25 16:03:08 · 148 阅读 · 0 评论 -
66. Plus One
Problem:Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number 0 itself.原创 2017-09-08 19:44:02 · 239 阅读 · 0 评论 -
15.3Sum
class Solution {public: vector> threeSum(vector& nums) { vector> result; if (nums.size() < 3) { return result; } const int target = 0;原创 2017-09-18 16:58:45 · 365 阅读 · 0 评论 -
89. Gray Code
Problem:The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print th原创 2017-09-26 18:24:33 · 169 阅读 · 0 评论 -
73. Set Matrix Zeroes
Problem:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up:Did you use extra space?A straight forward solution using O(mn) space is pr原创 2017-09-26 19:16:28 · 269 阅读 · 0 评论 -
134. Gas Station
Problem: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 s原创 2017-09-27 19:16:18 · 176 阅读 · 0 评论 -
1. Two Sum
question: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原创 2017-09-06 20:50:04 · 161 阅读 · 0 评论