2021-03-30L链表两数相加&&搜索二维有序矩阵

最新推荐文章于 2022-11-16 16:56:28 发布

coderLcy

最新推荐文章于 2022-11-16 16:56:28 发布

阅读量137

点赞数

分类专栏：每日一题

本文链接：https://blog.csdn.net/qq_44805237/article/details/115337660

版权

每日一题专栏收录该内容

208 篇文章 2 订阅

订阅专栏

1.

var addTwoNumbers = function(l1, l2) {
  let head = null, tail = null, tag = 0, sum = 0;
  while(l1 || l2){
    const n1 = l1 ? l1.val : 0
    const n2 = l2 ? l2.val : 0
    sum = n1 + n2 + tag
    if(sum >= 10){
      sum = sum - 10
      tag = 1
    }else{
      tag = 0
    }
    if(!head){
      head = tail = new ListNode(sum);
    }else{
      tail.next = new ListNode(sum)
      tail = tail.next
    }
    if(l1) l1 = l1.next
    if(l2) l2 = l2.next
  }
  if(tag){
    tail.next = new ListNode(1)
  }
  return head
};

2.

var searchMatrix = function(matrix, target) {
  let l = matrix[0].length - 1;
  let d = 0;
  while(l >= 0 && d < matrix.length){
    if(matrix[d][l] < target){
      d++
    }else if(matrix[d][l] > target){
      l--
    }else{
      return true
    }
  }
  return false
};