![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法学习
LiXi233
归去来兮
展开
-
leetcode面试题02.02返回倒数第K个节点
题目描述题目链接代码public int kthToLast(ListNode head, int k) { //链表的长度 int length = 0; ListNode temp = head; while (temp != null) { length++; if (k == 1 && temp.next == null) { re原创 2020-12-13 20:38:24 · 1076 阅读 · 0 评论 -
leetcode430 扁平化多级双向链表
题目描述题目链接代码public Node flatten(Node head) { if (head == null) { return null; } Node temp = head; while (temp != null && temp.child == null) { temp = temp.next; } if (temp ==原创 2020-12-13 20:11:36 · 1081 阅读 · 0 评论 -
leetcode240 搜索二维矩阵II
题目描述题目链接代码public boolean searchMatrix(int[][] matrix, int target) { boolean ans = false; for (int i = 0; i < matrix[0].length; i++) { if (matrix[0][i] > target) { break; } else { int high = 0;原创 2020-12-11 17:07:58 · 1076 阅读 · 0 评论 -
leetcode69 x的平方根
题目描述题目链接代码public int mySqrt(int x) { int left = 0; int right = x; int res = -1; while (left <= right) { int mid = (left + right) >> 1; //强转 if ((long) mid * mid <= x) {原创 2020-12-11 15:42:54 · 2060 阅读 · 0 评论 -
leetcode540 有序数组中的单一元素
题目描述题目链接代码 public int singleNonDuplicate(int[] nums) { int left = 0; int right = nums.length - 1; while (left <= right) { int mid = (left + right) >> 1; int midVal = nums[mid]; //m原创 2020-12-11 15:07:35 · 1093 阅读 · 0 评论