摘要：
题目：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as... 阅读全文
摘要：
题目：Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't ... 阅读全文
摘要：
题目：Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not allocate extra space fo... 阅读全文
摘要：
题目：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.提示：此题其... 阅读全文
摘要：
题目：Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must close in the corre... 阅读全文
摘要：
题目：Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is... 阅读全文
摘要：
题目：Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After... 阅读全文
摘要：
题目：Write a function to find the longest common prefix string amongst an array of strings.代码：class Solution {public: string longestCommonPrefix(vect... 阅读全文
摘要：
题目：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.提示：此题只要熟悉罗马数字的书写语法，做起来就不会太难，关于罗马数字的介绍可以参考... 阅读全文
摘要：
题目：The string"PAYPALISHIRING"is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font... 阅读全文