Two Sum II - Input array is sorted

最新推荐文章于 2020-12-23 11:34:37 发布
最新推荐文章于 2020-12-23 11:34:37 发布
阅读量259 收藏
点赞数
分类专栏： 两根指针 候着 strStr
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/sjphiChina/article/details/51683187
版权
strStr 同时被 3 个专栏收录
360 篇文章 0 订阅
订阅专栏
候着
26 篇文章 0 订阅
订阅专栏
两根指针
14 篇文章 0 订阅
订阅专栏

这道题固然用两根指针能做，自己之后还要想一下二叉做法，候着吧。

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int [] result = new int[2];
        if (numbers == null || numbers.length < 2) {
            return result;
        }
        int left = 0, right = numbers.length - 1;
        while (left < right) {
            int num = numbers[left] + numbers[right];
            if (num > target) {
                right--;
            } else if (num < target) {
                left++;
            } else {
                result[0] = left + 1;
                result[1] = right + 1;
                return result;
            }
        }
        return null;
        // int [] result = new int[2];
        // if (numbers == null || numbers.length < 2) {
        //     return result;
        // }
        // int left = 0, right = numbers.length - 1;
        // while (left + 1 < right) {
        //     int mid = left + (right - left) / 2;
        //     if (numbers[mid] <= target) {
        //         right = mid;
        //         break;
        //     } else {
        //         left = mid;
        //     }
        // }
    }
}


sjphiChina
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
LeetCode 167. Two Sum II - Input array is sorted--Python解法
个人博客
11-07 291
LeetCode 167. Two Sum II - Input array is sorted–Python解法 LeetCode题解专栏：LeetCode题解 LeetCode 所有题目总结：LeetCode 所有题目总结 大部分题目C++和Python的解法都有。 题目地址：Two Sum II - Input array is sorted - LeetCode Given an a...
LeetCode--Python解析【Two Sum II - Input array is sorted】(167)
ZJRN1027的博客
05-21 765
题目：方法一：二分查找的方法由于是顺序数组，所以一次遍历数组中的元素然后求target与该元素的差值从数组中以该元素为开头的子数组中，使用二分查找，寻找等于差值的元素下标组成列表返回class Solution(object):     def twoSum(self, numbers, target):         """         :type numbers: List[int]  ...
[LeetCode By Python]167. Two Sum II - Input array is sorted
sharonITlion的博客
02-06 348
题目： Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two
leetcode 167. Two Sum II - Input array is sorted（python）
王大呀呀的博客
12-23 164
描述 Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must
leetcode python3 简单题167. Two Sum II - Input array is sorted
从此做一个俗人
05-03 157
1.编辑器 我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客： 链接 2.第一百六十七题 （1）题目 英文： Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific t...
leetcodepushfront-leetcode:leetcode问题
07-07
array is sorted 1.6 (170) Two Sum III - Data structure design 1.7 (653) Two Sum IV - Input is a BST 1.8 (560) Subarray Sum Equals K 概括 对于总和问题， 一般有两种方法：一种是二指针技能，另一种是使用...
leetcode1004-leetcode:leetcode
07-01
II - Input array is sorted (E) 653. Two Sum IV - Input is a BST (E) -> 2 26. Remove Duplicates from Sorted Array (E) 27. Remove Element (E) 31. Next Permutation (M) * -> index 주의, 부등호 하나 틀림 ...
leetcode530-alogritme-interview:alogritme-面试
06-30
Input Array is Sorted 167 125 344 345 11 1-5 滑动窗口 Minimum Size Subarray Sum 209 3 438 76 第二章 查找表相关问题 2-1 set的使用 Intersection of Two Arrays 349 2-2 map的使用 Intersection of Two Arrays...
leetcode答案-LeetCode-Trip:LeetCode刷题代码，大佬勿入
06-30
leetcode 答案 LeetCode-Trip LeetCode刷题代码，大佬勿入。 为一年后的研究生找工作准备 目标是BAT的算法岗哈哈哈哈哈 争取做到每日一更 嗯…… ...Input array is sorted] Medium [2. Add Two Numbers]
leetcode530-Play-with-Algorithms:基本的算法和数据结构
06-30
leetcode 530 Play-with-Algorithms 基本的算法和数据结构 ...Input Array is Sorted 167 125 344 345 11 3-7 滑动窗口 Minimum Size Subarray Sum 209 3 438 76 713 补充1：更多数组中的问题 [无] [无] 303 121 1
【python】【leetcode】【算法题目167—Two Sum II - Input array is sorted】
一只奋斗的小虫的博客
12-04 448
一、题目描述 题目原文： Given an array of integers that is alreadysorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indi
LeetCode167 Two Sum II - Input array is sorted-python(easy)
revivre的博客
04-24 430
题目来源https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/discuss/51249/Python-different-solutions-(two-pointer-dictionary-binary-search).题目分析  给定一个已经按升序排序的整数数组，在其中找到两个数，使他们加起来为目标数值，最后返回这两个数的...
Two Sum II - Input array is sorted问题及解法
刘天的博客
03-25 501
问题描述： Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two
[LeeCode] 167. Two Sum II - Input array is sorted (Python)
热爱编程，热爱技术
06-14 151
167.Two Sum II - Input array is sorted Easy Given an array of integers that is alreadysorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that..
leetcode 167: Two Sum II - Input array is sorted
西施豆腐渣
12-31 9756
Two Sum II - Input array is sorted Total Accepted: 441 Total Submissions: 1017 Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a
167. Two Sum II - Input array is sorted（python+cpp）
小湉湉的博客
10-13 120
题目： Given an array of integers that is already sorted in ascending order,find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbe...
LeetCode Two Sum II - Input array is sorted(Two pointer问题)
多看多听多总结
08-19 941
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two number
167. Two Sum II - Input array is sorted python
lf
09-13 189
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers ...
【LeetCode】167. Two Sum II - Input array is sorted 解题报告（Python）
负雪明烛
04-18 2193
【LeetCode】Two Sum II - Input array is sorted 解题报告标签（空格分隔）： LeetCode题目地址：https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/#/description题目描述：Given an array of integers that is already sorte
You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it
最新发布
06-03
To merge k sorted linked lists, one approach is to repeatedly merge two of the linked lists until all k lists have been merged into one. We can use a priority queue to keep track of the minimum element across all k linked lists at any given time. Here's the code to implement this idea: ``` struct ListNode { int val; ListNode* next; ListNode(int x) : val(x), next(NULL) {} }; // Custom comparator for the priority queue struct CompareNode { bool operator()(const ListNode* node1, const ListNode* node2) const { return node1->val > node2->val; } }; ListNode* mergeKLists(vector<ListNode*>& lists) { priority_queue<ListNode*, vector<ListNode*>, CompareNode> pq; for (ListNode* list : lists) { if (list) { pq.push(list); } } ListNode* dummy = new ListNode(-1); ListNode* curr = dummy; while (!pq.empty()) { ListNode* node = pq.top(); pq.pop(); curr->next = node; curr = curr->next; if (node->next) { pq.push(node->next); } } return dummy->next; } ``` We start by initializing a priority queue with all the head nodes of the k linked lists. We use a custom comparator that compares the values of two nodes and returns true if the first node's value is less than the second node's value. We then create a dummy node to serve as the head of the merged linked list, and a current node to keep track of the last node in the merged linked list. We repeatedly pop the minimum node from the priority queue and append it to the merged linked list. If the popped node has a next node, we push it onto the priority queue. Once the priority queue is empty, we return the head of the merged linked list. Note that this implementation has a time complexity of O(n log k), where n is the total number of nodes across all k linked lists, and a space complexity of O(k).

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值