这是Stanford算法课程第1部分第6周的作业，涉及哈希表和堆。作业包含两道题目，第一题要求计算在[-10000, 10000]区间内有多少不同整数x和y的和等于目标值t。可选挑战是实现自己的哈希表。第二题涉及构建两个堆，一个最大堆存储小于等于中位数的元素，另一个最小堆存储大于等于中位数的元素，以确保中位数的位置。"
136886012,594666,灰度图恢复与存储：华为OD真题解析与JavaScript实现,"['图像处理', '算法', '开发语言', '华为OD']
太久没有更新博客了，原来做的作业都没有写blog，现在印象已经有点模糊了，不过还是得贴出来，方便以后查阅。。
本次作业算是比较简单的一次。。。。
一共两道题，第一题题目要求如下：
Question 1
Download the text file
here. (Right click and save link as).
The goal of this problem is to implement a variant of the 2-SUM algorithm (covered in the Week 6 lecture on hash table applications).
The goal of this problem is to implement a variant of the 2-SUM algorithm (covered in the Week 6 lecture on hash table applications).
The file contains 1 million integers, both positive and negative (there might be some repetitions!).This is your array of integers, with the ith row of the file specifying the ith entry of the array.
Your task is to compute the number of target values t in the interval [-10000,10000] (inclusive) such that there are distinctnumbers x,y in the input file that satisfy x+y=t
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
