摘要： 题目：Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, return1->2->3.解题思路：设置两个指针CurrList和NewList，初始化为同一头指针，CurrList不断向链表尾部扫描，如果当前节点的值不是重复值，就将该节点接到NewList尾部。代码：/** * Definition for 阅读全文

摘要： 题目：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 at the head of the list.解题思路：要给原有容器表示的数加1，主要需要处理的就是进位的问题。由于是加1，因此只有在当前数字为9的时候采进位。如果在数组的第0个元素上还需要进位，那么就需要在该元素前面增加一个数字1。代码：class Solution {public: v... 阅读全文

摘要： 题目：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 matter what you leave beyond the new length.解题思路：设置两个指针pa,pb，pa指针从0开始依次向n-1滑动，当pa指向的元素不是待删除的元素时，将pa指向的元素赋给pb指向的元素，同时pb向前滑动。代码：class Solution {publ 阅读全文