coding......

1.题目原文：Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.Th

7.Reverse IntegerReverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321Note:

题目：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.

题目如下：Write a function to find the longest common prefix string amongst an array of strings. 意思就是说写一个方法返回一个字符串数组中每个字符串共有的开头。比如:{“1235”,”152”,”14”}，就要返回”1”;又或者{“2235”,”52”,”41”}，就要返回”“（空字符串）。

题目：Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

题目原文：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.题意理解：题目的意思是说把两个排好序的list，合并成一个新的排好序的list,并返回。

题目：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 place with cons

1.题目原文：Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.2.题意解读：needle，haystack两个数组，返回haystack中首次出现needle的位置索引，如果没有出现，就返回-1。

题目原文Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.二分法查找

1. 题目原文The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...我认为比较好的示例应该是这样的：<1 1(经测试，是可以通过的)1 12 11（1个1）3 21（2个1）4 1211（1个2，1个1）