letcode刷题之两数相加

letcode里面刷题,坑还是链表不熟,(1)头结点还是有必要设置,否则返回的时候找不到位置;(2)先设置next到新节点再next到下一个节点;都是基础知识

/*
 * 
 * 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
 * */
class CONF{
	public static final int initialVal=-1;
}

class ListNode {
      int val=CONF.initialVal;
      ListNode next=null;
      ListNode(int x) { val = x; }
      ListNode(){};
}
 
public class addTwoNumber {
    public ListNode add(ListNode l1, ListNode l2) {
    	ListNode resHeadNode = new ListNode();
    	ListNode leftNode = l1.next,rightNode = l2.next,resNode=resHeadNode;
    	int addon=0;
    	while(leftNode!=null){
    	    ListNode tmpNode=new ListNode((leftNode.val+rightNode.val)%10+addon);
    		addon=(leftNode.val+rightNode.val)/10;
    	    resNode.next=tmpNode;
    	    resNode=resNode.next;
    		leftNode = leftNode.next;
    		rightNode= rightNode.next;
    	}
    	return resHeadNode;
    }
    public void initList(String[] vals,ListNode headList){
    	ListNode valList=headList;
    	for(int i=0;i<vals.length;i++){
    		ListNode tmpnode=new ListNode(Integer.valueOf(vals[i]));
    		valList.next=tmpnode;
    		valList=valList.next;
    	}
    }
    public static void printList(ListNode headList){
    	ListNode resNode=headList.next;
    	while(resNode!=null){
    		System.out.println("res:"+resNode.val);
    		resNode = resNode.next;
    	}
    }
    public static void main(String[] args){
    	addTwoNumber instance =new addTwoNumber();
    	ListNode leftList=new ListNode();
    	ListNode rightList=new ListNode();
    	instance.initList(new String[]{"2","4","3"},leftList);
    	instance.initList(new String[]{"5","6","4"},rightList);
    	System.out.println("leftList:");
    	printList(leftList);
    	System.out.println("rightList:");
    	printList(rightList);
    	ListNode resNodeList=instance.add(leftList,rightList);
    	System.out.println("resNodeList:");
    	printList(resNodeList);
    }
}

  

转载于:https://www.cnblogs.com/laodageblog/p/5705127.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值