Leetcode 链表
发布时间:2020-12-14 04:28:50 所属栏目:大数据 来源:网络整理
导读:public ListNode removeNthFromEnd(ListNode head, int n) { int res = onePass(head,n); return res == n ? head.next : head; } int onePass(ListNode curr, int n) { if (curr == null ) return 0 ; int res = onePass(curr.next,n); if (res == n) { cur
public ListNode removeNthFromEnd(ListNode head,int n) { int res = onePass(head,n); return res == n ? head.next : head; } int onePass(ListNode curr,int n) { if(curr == null) return 0; int res = onePass(curr.next,n); if(res == n) { curr.next = curr.next.next; } return res + 1; } //转自leetcode 19.?Remove Nth Node From End of List? minimum-depth-of-binary-treeGiven a binary tree,find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public int find(TreeNode root) { int a1=99999,a2=99999; if(root.left==null&&root.right==null) //找到叶节点 { return 1; } if(root.left!=null) { a1=find(root.left); } if(root.right!=null) { a2=find(root.right); } return Math.min(a1,a2)+1; } public int run(TreeNode root) { if(root==null) return 0; //这句遗漏了,要考虑为空的情况 int t= find(root); return t; } } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |
推荐文章
站长推荐
- Delphi For iOS开发指南(17):让应用程序禁止竖屏
- Perl/Tk Menus: Past, Present and Future
- php – Laravel or Phalcon for a heavy traffic
- bigdata数据分析(一):Java环境配置
- java – WebLogic – 在WebLogic Server中部署
- [VB.Net]MD5/MD160/SHA1/SHA256/SHA384/SHA512/B
- delphi – 表单中的消息“未找到ToolsAPI”
- 从Delphi开始学Cocos2dx-3.0[9]:持续动作之缩放持
- 大数相加
- GO语言-struct to buf
热点阅读