# 【Java】对两个用链表表示的整数求和

1378人阅读 评论(0)

	public LinkedList addLists(LinkedList l1, LinkedList l2, int carry){
if (null == l1 && null == l2 && 0 == carry) return null;
LinkedList result = new LinkedList();
int value = carry;
if (l1 != null) value += l1.data;
if (l2 != null) value += l2.data;
result.data = value % 10;
LinkedList more = addLists(null == l1? null : l1.next, null == l2? null : l2.next, value > 10? 1 : 0);
result.setNext(more);
return result;

}

public class PartialSum {
public LinkedList sum = null;
public int carry = 0;
}

LlinkedList addLists(LinkedList l1, LinkedList l2) {
int len1 = length(l1);
int len2 = length(l2);

if(len1 < len2) {
l1 = padList(l1, len2 - len1);
}
else {
l2 = padList(l2, len1 - len2);
}

PartialSum sum = addListsHelper(l1, l2);
if (sum.carry == 0) {
return sum.sum;
}
else {
LinkedList result = interBefore(sum.sum, sum.carry);
return result;
}
}

PartialSum addListsHelper(LinkedList l1, LinkedList l2) {
if (null == l1 && null == l2) {
PartialSum sum = new PartialSum();
return sum;
}

PartialSum sum = addListHelper(l1.next, l2.next);
int val = sum.carry + l1.data + l2.data;
LinkedList full_result = insetBefore(sum.sum, val%10);
sum.sum = full_result;
sum.carry = val / 10;
return sum;
}

LinkedList padList(LinkedList l, ind padding) {
LinkedList head = l;
for (int i = 0; i< padding; i++) {
LinkedList n = new LinkedList(0, null, null);
head.pre = n;
n.next = head;
head = n;
}
return head;
}

LinkedList insetBefore(LinkedList list, int data) {
LinkedList node = new LinkedList(data, null, null);
if(list != null) {
list.prev = node;
node.next = list;
}
return node;
}

int length(LinkedList l) {
int count = 0;
LinkedList p = l;
if (null == l) return 0;
while (p != null) {
count++;
p = p.next;
}
return count;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：109490次
• 积分：2993
• 等级：
• 排名：第11744名
• 原创：180篇
• 转载：107篇
• 译文：0篇
• 评论：10条
文章分类
评论排行
最新评论