LC160. 相交链表
//写过的题型回忆起来了思路就是定义两个指针进行一个同时遍历操作
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
if(headA == null || headB == null)
return null;
ListNode pA = headA;
ListNode pB = headB;
while(pA != pB){
pA = pA == null ? headB : pA.next;
pB = pB == null ? headA : pB.next;
}
return pA;
}
}
LC213. 打家劫舍 II
LC213. 打家劫舍 II
//这是打家劫舍得进阶版就是说所有房屋成环,那么也就是说和第一道题范围有所不同,第一题得打家劫舍范围是[0,n-1],这道题有两个范围[0,n - 2][1,n - 1]。
class Solution {
public int rob(int[] nums) {
int n = nums.length;
if(n == 0)
return 0;
else if(n == 1){
return nums[0];
}else if(n == 2){
return Math.max(nums[0],nums[1]);
}
return Math.max(myRange(nums,0,n-2),myRange(nums,1,n-1));
}
public int myRange(int[] nums,int left,int right){
int first = nums[left],second = Math.max(nums[left],nums[left + 1]);
for(int i = left + 2;i <= right;i++){
int temp = second;
second = Math.max(first + nums[i],second);
first = temp;
}
return second;
}
}
LC572. 另一棵树的子树
//首先先对主树进行搜索找到对应子树的位置如果找到当前位置的话我们就要定义一个函数isSameTree去判断他们当前的树是否相同
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
//该函数负责找到子树的位置
public boolean isSubtree(TreeNode root, TreeNode subRoot) {
//如果子树为空要么已经找到了并且判断完了可以返回true
if(subRoot == null) return true;
//主树找遍了都没有发现子树的位置返回false
if(root == null) return false;
//后两个函数负责找左右子树当中书否存在对应的子树,当找到的话就判断子树和当前树是否相同
return isSameTree(root,subRoot) || isSubtree(root.left,subRoot) || isSubtree(root.right,subRoot);
}
//定义一个函数去判断当前找到的子树是否是相同树
public boolean isSameTree(TreeNode root,TreeNode t){
if(root == null && t == null) return true;
if(root == null || t == null || root.val != t.val) return false;
return isSameTree(root.left,t.left) && isSameTree(root.right,t.right);
}
}