240. 搜索二维矩阵 II - 力扣LeetCode思路直接从右边开始判断大于往下走小于就往左走class Solution { public boolean searchMatrix(int[][] matrix, int target) { int nmatrix.length; int mmatrix[0].length; //从右上角开始 int i0; int jm-1; while(i n j0){ if(matrix[i][j]target) return true; //往下走 if(target matrix[i][j]) { i; //往左走 }else { j--; } } return false; } }160. 相交链表 - 力扣LeetCode思路标准的长度差法完全正确分别计算两个链表的长度让长链表的指针先走长度差步然后两个指针一起走相遇点就是交点/** * 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(headAnull || headB null){ return null; } ListNode nodeAheadA; ListNode nodeBheadB; int lenA0,lenB0; while(nodeA!null){ nodeAnodeA.next; lenA; } while(nodeB!null){ nodeBnodeB.next; lenB; } //始终认为 ab if(lenBlenA){ ListNode tmpheadA; headAheadB; headBtmp; int lenClenA; lenAlenB; lenBlenC; } int lenClenA-lenB; while(lenC0){ headAheadA.next; lenC--; } while(headA!null headB !null){ if(headAheadB){ return headA; } headAheadA.next; headBheadB.next; } return null } }