Two Sum II - Input array is sorted

#167 Two Sum II - Input array is sorted

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 be less than index2.

Note:

  • Your returned answers (both index1 and index2) are not zero-based.
  • You may assume that each input would have exactly one solution and you may not use the same element twice.
Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

1、哈希表

和之前的sum一样的做法。循环遍历,判断补数,map用键访问。是可以通过,但是没有利用好数组是升序的,是一种通用解法。

注意一个地方,就是vector<int>re申明的时候,一定要给定大小(2),否则下面不可以用[0]访问,因为它的size=0。但是可以用push_back()。

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        //这个题目是不是做过呀,哈希表来做
        map<int,int>hash_table;
        int numSize=numbers.size();
        vector<int> re(2);
        for(int i=0;i<numSize;i++)
        {
            if(hash_table.find(numbers[i])!=hash_table.end())
            {
                //因为是从0开始遍历最先存进去的肯定是一个元素
                re[0]=hash_table[numbers[i]];
                re[1]=i+1;  //题目中输出案例,第一个元素是1
                return re;
            }
            else{
                //pair<int,int>newpair;
                hash_table.insert(make_pair(target-numbers[i],i+1));                                
            }
        
        }
        return re;
        
    }
};

2、双指针法

因为数组是按序排的,已经排好序的数组,去查找两个数的和,应该要想到双指针啊。

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int p1=0,p2=numbers.size()-1;
        vector<int>re(2);
        while(p1<p2)
        {
            if(numbers[p1]+numbers[p2]>target)
            {
                p2--;
                
            }
            else if(numbers[p1]+numbers[p2]<target)
            {
                p1++;
            }
            else
            {
                re[0]=p1+1;
                re[1]=p2+1;
                return re;
                
            }
            
        }
        return re;
    }
};

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
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、付费专栏及课程。

余额充值