![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
代码学习
代码
展开
-
找出两个链表的交点
常规方法 /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */...原创 2019-06-14 20:59:08 · 595 阅读 · 0 评论 -
反转链表
对于反转链表的思想感觉很别扭,需要多看,多想,克服困难 /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { ...原创 2019-06-14 21:40:23 · 92 阅读 · 0 评论 -
合并两个有序链表
常规 /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode mergeT...原创 2019-06-14 21:45:49 · 154 阅读 · 0 评论 -
打家劫舍三
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { pu...原创 2019-09-12 11:16:35 · 417 阅读 · 0 评论