Find pairs equal zero -- Paypal

最新推荐文章于 2021-12-20 15:55:51 发布
最新推荐文章于 2021-12-20 15:55:51 发布
阅读量600 收藏
点赞数
CC 4.0 BY-SA版权
分类专栏： C++ 文章标签： 算法
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/u010570643/article/details/9127749
本文提供了一种算法，用于在两个等长整数数组中找到所有和为零的元素配对。该算法使用哈希集合来高效地识别符合条件的配对，避免了使用数组索引进行交叉检查的需求。
Problem
Given 2 equal-length arrays of integers, find pairs, one from each array, that sum to 0. 

-- note that one wrinkle of this problem over the more usual form, which is to do this in a single array, 
is that you can't use the indexes / iterators crossing each other to know to stop, 
rather their /values/ have to cross (if you're doing it right, at or near 0).

Solution

#include <iostream>
#include <iomanip>
#include <hash_set>

using namespace std;

void FindPairsEqualZero(int *arr1, int* arr2, int len)
{
    hash_set<int> h1, h2;
    for(int i = 0; i < len; ++i){
        h1.insert(arr1[i]);
        h2.insert(arr2[i]);
    }

    for(hash_set<int>::iterator it = h1.begin(); it != h1.end(); ++ it){
        if(h2.find(-*it) != h2.end()){
            cout << "(" << setw(4) << *it << ", ";
            cout << setw(4) << -*it << ")" << endl;
        }
    }
}


int main(int argc, char* argv[])
{
    int *arr1, *arr2;

    for(int i = 1; i < 21; ++i){
        arr1 = new int[i];
        arr2 = new int[i];

        for(int j = 0; j < i; ++j){
            arr1[j] = rand() % i - i / 2;
            arr2[j] = rand() % i - i / 2;
        }

        cout << "Array 1:" << endl;
        for(int j = 0; j < i; ++j){
            cout << setw(4) << arr1[j];
        }
        cout << endl;

        cout << "Array 2:" << endl;
        for(int j = 0; j < i; ++j){
            cout << setw(4) << arr2[j];
        }
        cout << endl;

        FindPairsEqualZero(arr1, arr2, i);

        cout << "-------------------------------------------";
    }

return 0;
}

Output
Array 1:
   0
Array 2:
   0
(   0,    0)
-------------------------------------------
Array 1:
  -1   0
Array 2:
  -1  -1
-------------------------------------------
Array 1:
  -1   0   1
Array 2:
  -1   1   1
(  -1,    1)
(   1,   -1)
-------------------------------------------
Array 1:
  -1  -1   1   1
Array 2:
   1   1   0  -2
(  -1,    1)
-------------------------------------------
Array 1:
  -1   0   0  -1   1
Array 2:
   2   1   0  -1  -2
(  -1,    1)
(   0,    0)
(   1,   -1)
-------------------------------------------
Array 1:
   2   2   0   2  -2   2
Array 2:
  -3  -3   1  -2  -3   0
(   2,   -2)
(   0,    0)
-------------------------------------------
Array 1:
   1   2  -3  -2   1  -3   0
Array 2:
  -1  -1   1  -2  -2   1  -3
(   1,   -1)
(   2,   -2)
-------------------------------------------
Array 1:
  -1  -3   0   2  -4  -4  -4   2
Array 2:
   1  -2  -1  -2  -2   2  -4   1
(  -1,    1)
(   2,   -2)
-------------------------------------------
Array 1:
   1   3  -1  -1  -4  -4  -4   3   4
Array 2:
   2   1   2  -2   1  -3   1   1  -3
(   3,   -3)
(  -1,    1)
-------------------------------------------
Array 1:
  -1   1   2   3   4  -2   4  -1   2  -2
Array 2:
   4  -2   3  -3  -4   0   3  -5   1   1
(  -1,    1)
(   2,   -2)
(   3,   -3)
(   4,   -4)
-------------------------------------------
Array 1:
   0   2  -5  -2  -1   1   4  -2   0   0  -1
Array 2:
  -3   4   5   3  -4  -3  -3   1   4   2   1
(  -5,    5)
(  -2,    2)
(  -1,    1)
(   4,   -4)
-------------------------------------------
Array 1:
   3   4  -3   1  -5   3  -1  -5  -1  -4  -4   3
Array 2:
  -2   4   5   3   5  -3  -1  -4  -6   4   4   2
(  -5,    5)
(   3,   -3)
(  -4,    4)
(   4,   -4)
(  -3,    3)
(   1,   -1)
-------------------------------------------
Array 1:
  -3  -3  -3   6   1   3  -5   2  -5   1   3   6  -6
Array 2:
  -6  -2  -4   4   3   5  -5  -6   3   4   1  -1  -4
(  -3,    3)
(   6,   -6)
(   1,   -1)
(  -5,    5)
(   2,   -2)
-------------------------------------------
Array 1:
   4  -7   5   4  -3   1   6  -5   0  -6   0  -1   6  -1
Array 2:
   4   1   1  -2   4   6   6   2   1  -7   0   6  -7   0
(   0,    0)
(  -6,    6)
(  -1,    1)
-------------------------------------------
Array 1:
   7   2  -3  -7  -4   6  -3   1  -4  -7   1   7  -3   5   6
Array 2:
   6   7  -5   3  -4   5   1  -7  -4   4   4   1   0   5   0
(   7,   -7)
(  -3,    3)
(   5,   -5)
(  -7,    7)
(  -4,    4)
-------------------------------------------
Array 1:
  -2   6  -2  -1  -4   2  -8   0   2   3   5  -4   1  -6  -3  -3
Array 2:
  -5   1   7   0  -1   2  -1  -2  -2  -7   6   0   6   3  -5   4
(  -2,    2)
(  -1,    1)
(  -4,    4)
(   2,   -2)
(   0,    0)
(   5,   -5)
(   1,   -1)
(  -6,    6)
(  -3,    3)
-------------------------------------------
Array 1:
   4   1   8   0   3  -3  -2  -4   0  -1  -2  -2  -4  -8  -7  -3  -3
Array 2:
   3  -6   3   1  -8   6  -7   3  -8   2   0   1   4  -6   7   5   7
(  -4,    4)
(   0,    0)
(   8,   -8)
(  -3,    3)
(  -2,    2)
(  -1,    1)
(  -7,    7)
-------------------------------------------
Array 1:
   5  -2   4   1   2  -2  -8   4   3   4  -6  -1  -1   8  -3   5  -1   2
Array 2:
  -2  -1  -3   0  -6  -5  -8   4  -2   2  -5   4   1   3  -8  -2  -4  -8
(   5,   -5)
(  -2,    2)
(   4,   -4)
(   1,   -1)
(   2,   -2)
(   3,   -3)
(  -1,    1)
(   8,   -8)
(  -3,    3)
-------------------------------------------
Array 1:
  -3  -9  -1  -9   2   1  -3   7  -5  -3  -8   8   6  -8   1   5  -9   0  -7
Array 2:
  -1   7  -2   7  -2   5  -7  -3   5  -3   7   9   1   8  -6   6   1   7   6
(  -9,    9)
(  -1,    1)
(   7,   -7)
(   2,   -2)
(   1,   -1)
(  -5,    5)
(  -8,    8)
(   6,   -6)
(  -7,    7)
-------------------------------------------
Array 1:
  -3   8  -8   7   4   4   2   3  -3   8   3  -7   2  -8   3  -8  -3  -7  -7  -9
Array 2:
  -5   1  -5   4  -6   4   9   0   7   7   0  -2  -5 -10  -3   9  -5  -6   2  -9
(  -9,    9)
(   2,   -2)
(   3,   -3)
(  -7,    7)
-------------------------------------------
Press any key to continue . . .
【LLM 论文】UPRISE：使用 prompt retriever 检索 prompt 来让 LLM 实现 zero-shot 解决 task
VLyb
05-04 1765
总的来说，这篇论文提出了一个很新颖的思路：prompt retriever，从而提高 LLM 的 zero-shot 的能力。同时还研究了 prompt retriever 从训练的任务类型推广到其他未见过的任务类型，以及从小的 LLM 推广到更大规模的。
使用1-5随机数生成器产生1-7的随机数（Google Technical Interview）
u010570643的专栏
05-15 1645
Problem Generate random between 1..7(Google Technical Interview).Write a method to generate a random number between 1 and 7, given a method that generates a random number between 1 and 5 (i. e. , imp
ORA-01476: divisor is equal to zero解决方法
飞哥在线
06-01 11万+
<br />ORA-01476: divisor is equal to zero 这个错误是sql语句中存在除数为0的情况<br />解决方法就是用decode将等于0的情况转成1或者其他就可以了，例如<br />select trunc(sysdate)-to_date(to_char(sysdate,'yyyymm'),'yyyymm') from dual;<br />执行这个语句，当天如果某个月的第一天时，这个结果就为0<br />我将0转成1是这样做的。<br /> <br /><br />se
C神奇国度--Branchless code--Bit Twiddling Hacks
saturn254的专栏
05-23 1164
https://graphics.stanford.edu/~seander/bithacks.html Bit Twiddling Hacks By Sean Eron Anderson seander@cs.stanford.edu Individually, thecode snippets here are in the public domain(unless otherwise noted) — feel free to use them however you please. The..
位操作技巧_大牛级别
作一个独立连续的思考者
09-01 2902
http://graphics.stanford.edu/~seander/bithacks.html#IntegerLogLookup Bit Twiddling Hacks By Sean Eron Anderson seander@cs.stanford.edu
43.一维卷积-航空公司评论情感预测
热门推荐
potato123232的博客
12-20 25万+
之前我们使用的都是二维卷积，二维卷积处理图像问题，这次我们使用一维卷积，一维卷积处理序列问题 一维卷积就是在一个序列上进行滑动，从而得出一维卷积的结果，详细一维卷积的介绍可以看一下这个深度学习面试题09：一维卷积（Full卷积、Same卷积、Valid卷积、带深度的一维卷积） - 黎明程序员 - 博客园 下面我们使用一维卷积对航空评论数据进行训练，数据集选用了与41.RNN循环网络-航空评论情感预测_potato123232的博客-优快云博客这里的数据集相同，数据预处理部分与连接中的方法也完全相...
Bit Twiddling Hacks
ShmilyCode的博客
06-12 5893
前段转自 http://blog.sina.com.cn/s/articlelist_1249713681_14_1.html 作者：很拽的土豆 Bit Twiddling Hacks By Sean Eron Anderson seander@cs.stanford.edu Individually, the code snippets here are in the public d
位运算
xuexiaokkk的博客
07-08 776
Bit Twiddling Hacks By Sean Eron Anderson seander@cs.stanford.edu Individually, the code snippets here are in the public domain (unless otherwise noted) — feel free to use them however you please.
(轉貼) Bit Twiddling Hacks (SOC) (Verilog) (C)
weixin_34253539的博客
01-08 560
Abstract無論寫RTL或者寫firmware，巧妙的Bit運算均非常有效率。轉貼一篇Standford大學Sean Eron Anderson所整理的一些Bit運算Hacks。 Introduction轉貼自Sean Eron Anderson的Bit Twiddling Hacks，僅對HTML做一些排版整理。 Bit Twiddling Hacks By Sean Eron And...
Bit Twiddling Hacks(位操作相关的算法)
玄冬Wong
04-09 500
  原文：Bit Twiddling Hacks http://graphics.stanford.edu/~seander/bithacks.html   Bit Twiddling Hacks By Sean Eron Andersonseander@cs.stanford.edu Individually, the code snippets here are in the p...
可以装逼的位运算
weixin_30609287的博客
04-27 668
Hacker's Delight高效程序的奥秘和stanford这篇文章，用位运算不想装逼都难 http://graphics.stanford.edu/~seander/bithacks.html Bit Twiddling Hacks By Sean Eron Andersonseander@cs.stanford.edu Individually, thecode snippets...
spark-all-pairs-shortest-path
05-21
./persistent-hdfs/bin/hadoop fs -rm /vol/all-pairs-shortest-path_2.10-1.0.jar ./persistent-hdfs/bin/hadoop fs -put all-pairs-shortest-path_2.10- 1.0.jar hdfs：//ec2-54-146-149-83.compute-1.amazonaws....
coc-pairs：coc.nvim的基本自动对扩展
02-02
注意b:coc_paires已重命名为b:coc_pairs 要增强体验，请签出:h coc#on_enter() 。 提示 您应该按预期禁用/删除此扩展程序的其他自动配对插件。 当您输入仅是下一个字符的配对字符时，它将仅向右移动一列。 当...
Electromagnetic tunneling through conjugated single-negative metamaterial pairs and double-positive layer with high-magnetic fields
02-05
We show that resonant tunneling of electromagnetic (EM) fields can occur through a six-layer structure con-sisting of two pairs of bilayer slabs: one being an epsilon-negative layer and the other ...
查找数组中的缺失的2个数字
u010570643的专栏
06-03 2218
Problem Two numbers are missing from the first hundred numbers. They are NOT sorted. How to find them?  You can't sort.. and can't iterate one by one.. has to be less than O(N)? Can't use stack , se
面试 改错题-2
u010570643的专栏
05-15 1124
Problem Find as many issues as possible and correct them: char *GenerateRandomString(void) { int i; char RandomString[10]; for(i = 0; i <= 10; i++) { RandomString[i] = ra
面试 改错题-1
u010570643的专栏
05-15 1082
Problem Find as many issues as possible and correct them: malloc(n) allocates n bytes in the heap. int main(void) { int *ptr = (int *) malloc(10); for(int i =0; i <10; i++) {
转置整数方阵
u010570643的专栏
05-22 929
Problem Transpose an integer array Solution #include using namespace std; int** create_matrix(int row, int col) { int **m = new int* [row]; for(int i = 0; i < row; i++){ m[i] =
zero-dce
最新发布
03-08
### Zero-DCE Algorithm Implementation and Usage in Image Enhancement The Zero-Reference Deep Curve Estimation (Zero-DCE) algorithm is a deep learning-based method designed to enhance low-light images without requiring paired training data, which means it does not need corresponding well-exposed reference images during the training phase[^1]. This characteristic makes Zero-DCE particularly powerful for practical applications where obtaining such pairs can be challenging. In terms of architecture, Zero-DCE employs an end-to-end trainable network that learns pixel-wise curves for adjusting brightness while preserving details. The model outputs multiple illumination maps representing different levels of enhancement. These maps are combined through weighted summation with original input images to produce enhanced results. For implementing this approach, one typically uses frameworks like TensorFlow or PyTorch. Below shows how to implement basic components using Python code: ```python import torch from torchvision import models import torch.nn as nn class EnhanceNet(nn.Module): def __init__(self): super(EnhanceNet, self).__init__() # Define layers here based on paper specifications def forward(self, x): curve_maps = ... # Output from neural net enhanced_image = ... # Apply curve mappings to input image 'x' return enhanced_image ``` To train the model effectively, loss functions play a crucial role. In addition to standard losses used in computer vision tasks, specific constraints were introduced into the objective function to ensure physical plausibility and prevent overfitting issues common when working with unpaired datasets: - Spatial consistency loss encourages smooth transitions between adjacent pixels. - Exposure control loss ensures global exposure remains within reasonable bounds. - Color constancy loss maintains natural color balance across all regions. Once trained successfully, applying pre-trained weights allows real-time processing even on mobile devices due to lightweight design principles adopted throughout development stages.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值