package com.lxg.algorithm;
import java.util.Arrays;
public class Solution06 {
/**
* @param l1: the first list
* @param l2: the second list
* @return: the product list of l1 and l2
*/
public static long multiplyLists(ListNode l1, ListNode l2) {
// write your code here
ListNode temp1 = l1;
ListNode temp2 = l2;
int len1 = 0,len2 = 0;
while (temp1 != null) {
len1++;
temp1 = temp1.next;
}
StringBuilder str1 = new StringBuilder();
temp1 = l1;
for (int i = 0; i < len1; i++) {
str1.append(String.valueOf(temp1.val));
temp1 = temp1.next;
}
while (temp2!= null) {
len2++;
temp2 = temp2.next;
}
StringBuilder str2 = new StringBuilder();
temp2 = l2;
for (int i = 0; i < len2; i++) {
str2.append(String.valueOf(temp2.val));
temp2 = temp2.next;
}
System.out.println("str1 = " + str1);
System.out.println("str2 = " + str2);
long num1 = Integer.parseInt(String.valueOf(str1));
long num2 = Integer.parseInt(String.valueOf(str2));
return num1*num2;
}
public static void main(String[] args) {
ListNode L1 = new ListNode(1);
ListNode L2 = new ListNode(2);
ListNode L3 = new ListNode(3);
ListNode L4 = new ListNode(4);
L1.next = L2;
L3.next = L4;
long l = multiplyLists(L1, L3);
System.out.println("l = " + l);
}
}
给出两个链表形式表示的数字,写一个函数得到这两个链表相乘乘积
最新推荐文章于 2022-07-23 13:38:39 发布