leetcode005:Add 2 numbers

Add Two Numbers

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

思路:流程图思想


一开始想高效点编写出代码,画出流程图,但是却因为未接触过java关于链表的结构而感到疑惑,其实跟指针差不多。

代码:应该能优化的。

public class Add2Numbers {
	public ListNode add2Numbers(ListNode l1, ListNode l2){
		ListNode p = new ListNode(0);
    	ListNode store = null;
		if(l1==null||l2==null){//判断是否有空节点
			if(l2!=null){
				store = l2;
			}
			if(l1!=null){
				store = l1;
			}
			return store;
		}
		store = p;//store存储头节点
		int sum = l1.val+l2.val;
		int c = sum/10;//c为进位数
		store.val = sum%10;
		l1 = l1.next;
		l2 = l2.next;
		while(l1!=null || l2!=null){
			p.next = new ListNode(0);
			p=p.next;
			if(l1==null){
				sum = l2.val+c;
				l2=l2.next;
			}else if(l2==null){
				sum = l1.val+c;
				l1=l1.next;
			}else{
				sum = l1.val + l2.val+c;
				l1=l1.next;
				l2=l2.next;
			}
			if(sum>9){
				p.val=sum%10;
				c = sum/10;
			}else{
				c=0;
				p.val = sum;
			}
		}
            if(c!=0){
                p.next = new ListNode(c);
            }
		return store;
	}

结果:

Run Status: Accepted!
Program Runtime: 588 milli secs
Progress: 33/33 test cases passed.
Run Status: Accepted!
Program Runtime: 812 milli secs
Progress: 1555/1555 test cases passed.
待改善:
public ListNode add2Numbers(ListNode l1, ListNode l2){
    	ListNode store = null;
		if(l1==null||l2==null){
			if(l2!=null){
				store = l2;
			}
			if(l1!=null){
				store = l1;
			}
			return store;
		}
		ListNode p = new ListNode(0);
		store = p;
		int sum = l1.val+l2.val;
		int c = sum/10;
		if(c==1){//取余和减法哪个耗能?
		    store.val = sum-10;
                }else{
                    store.val = sum;
                }
		l1 = l1.next;
		l2 = l2.next;
		while(l1!=null || l2!=null){
			if(l1==null){
				if(c==0){//无进位时没必要计算,直接嫁接链表
					p.next=l2;
					break;	
				}
				sum = l2.val+c;//有必要用c么?
				l2=l2.next;
			}else if(l2==null){
				if(c==0){
					p.next=l1;
					break;	
				}
				sum = l1.val+c;
				l1=l1.next;
			}else{
				sum = l1.val + l2.val + c;
				l1=l1.next;
				l2=l2.next;
			}
			if(sum>9){
				p.next=new ListNode(sum-10);
				c = 1;
			}else{
				c=0;
				p.next = new ListNode(sum);
			}
			p=p.next;
		}
            if(c!=0){
                p.next = new ListNode(c);
            }
		return store;
	}



Add Two Numbers的问题

08-02

求助,LeetCode OJ 上的第二题Add Two Numbers,不熟练链表的我卡在这儿了,两个被加数位数相同算法没问题,位数不相同执行就当了。。。。一直没看出什么问题,调试器只有gdb,不会用。求大神帮忙看看是什么问题,跪谢。rnrn/*Add two numbersrn You are given two linked lists representing two non-negative numbers. rn The digits are stored in reverse order and each of their nodes contain a single digit. rn Add the two numbers and return it as a linked list.rn rn Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)rn Output: 7 -> 0 -> 8rn*/rnrn//定义简单结点rnstruct ListNode rn int val;rn ListNode *next;rn ListNode(int x) : val(x), next(NULL) rn;rnrn//创建解决方案rnclass Solution rnpublic:rn ListNode* addTwoNumbers( ListNode* l1, ListNode* l2 ) rn ListNode *pHead , *pCurr; //定义头指针 , 当前指针rn int sum , val1 , val2 , carry; //定义和,被加数1,被加数2,进位数rn pHead = ( ListNode * )malloc( sizeof( ListNode ) ); //创建第一个结点rn pCurr = pHead; //初始化当前结点rn carry = 0; //初始化进位数rn while( l1 != NULL || l2 != NULL ) //循环直到两个被加数的当前指针都为空rn rn val1 = l1 != NULL ? l1->val : 0; //为被加数赋值rn val2 = l2 != NULL ? l2->val : 0;rn rn sum = ( val1 + val2 + carry ) % 10; //求和rn carry = ( val1 + val2 + carry ) / 10; //求进位rn rn pCurr->val = sum; //为储存结果的链表添加数字rn if ( l1->next != NULL || l2->next != NULL) //储存结果的链表添加下一个结点rn pCurr->next = ( ListNode * )malloc( sizeof( ListNode ) );rn pCurr = pCurr->next;rn rn rn if ( l1 != NULL ) //被加数指针下移rn l1 = l1->next;rn rn if ( l2 != NULL )rn l2 = l2->next;rn rn rn rn if ( carry != 0) //循环结束进位结算rn pCurr->next = ( ListNode * )malloc( sizeof( ListNode ) );rn pCurr = pCurr->next;rn pCurr->val = carry;rn rn rn pCurr->next = NULL;rn rn return pHead; //输出结果rn rn; 论坛

没有更多推荐了,返回首页