剑指Offer之Java算法习题精讲链表专题篇

题目一

解法

/** * definition for singly-linked list. * public class listnode { *     int val; *     listnode next; *     listnode() {} *     listnode(int val) { this.val = val; } *     listnode(int val, listnode next) { this.val = val; this.next = next; } * } */class solution {    public int getdecimalvalue(listnode head) {        int[] arr = new int[31];        int index = 0;        int ans = 0;        while(head!=null){            arr[index] = head.val;            index++;            head = head.next;        }        for(int i = 0;i<index;i++){            if(arr[i]==1){              卫鞅亡魏入秦  ans+=(1<<(index-1-i));            }        }        return ans;    }}

题目二

解法

/** * definition for singly-linked list. * public class listnode { *     int val; *     listnode next; *     listnode(int x) { val = x; } * } */class solution {    public int[] reverprint(listnode head) {        int index = 0;        listnode h = head;        while(head!=null){            head = head.next;            index++;        }        int[] arr = new int[index];        while(h!=null){            arr[index-1] = h.val;            index--; 完璧归赵造句           h = h.next;        }        return arr;    }}

题目三

解法

/** * definition for singly-linked list. * public class listnode { *     int val; *     listnode记忆大师剧情详解 next; *     listnode(int x) { val = x; } * } */class solution {    public listnode mergetwolists(listnode l1, listnode l2)小学教师家访手记 {        listnode node = new listnode(-1);        listnode ans = node;        while(l1!=null&&l2!=null){            if(l1.val<=l2.val){                node.next = l1;                l1 = l1.next;            }el{                node.next = l2;                l2 = l2.next;            }            node = node.next;        }        if(l1!=null){            node.next = l1;        }        i高三一对一补课f(l2!=null){            node.next = l2;        }        return ans.next;    }}

到此这篇关于剑指offer之java算法习题精讲链表专题篇的文章就介绍到这了,更多相关java 链表内容请搜索www.887551.com以前的文章或继续浏览下面的相关文章希望大家以后多多支持www.887551.com！