给出两个链表形式表示的数字,写一个函数得到这两个链表相乘乘积

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);
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值