中文亚洲精品无码_熟女乱子伦免费_人人超碰人人爱国产_亚洲熟妇女综合网

當(dāng)前位置： 首頁 > news >正文

合肥哪里有做網(wǎng)站今天合肥剛剛發(fā)生的重大新聞

news 2025/7/8 16:26:14
合肥哪里有做網(wǎng)站,今天合肥剛剛發(fā)生的重大新聞,網(wǎng)站建設(shè)屬于什么稅,給政府做網(wǎng)站的科技公司文章目錄 順序表杭州電子科技大學(xué)在線評(píng)測(cè)2008 數(shù)值統(tǒng)計(jì)使用順序表實(shí)現(xiàn) 2014 青年歌手大獎(jiǎng)賽_評(píng)委會(huì)打分 Leetcode題目[LCP 01. 猜數(shù)字](https://leetcode.cn/problems/guess-numbers/description/)[LCP 06. 拿硬幣](https://leetcode.cn/problems/na-ying-bi/description/)[20…

文章目錄

  • 順序表
    • 杭州電子科技大學(xué)在線評(píng)測(cè)
      • 2008 數(shù)值統(tǒng)計(jì)
        • 使用順序表實(shí)現(xiàn)
      • 2014 青年歌手大獎(jiǎng)賽_評(píng)委會(huì)打分
    • Leetcode題目
      • [LCP 01. 猜數(shù)字](https://leetcode.cn/problems/guess-numbers/description/)
      • [LCP 06. 拿硬幣](https://leetcode.cn/problems/na-ying-bi/description/)
      • [2057. 值相等的最小索引](https://leetcode.cn/problems/smallest-index-with-equal-value/description/)
      • [485. 最大連續(xù) 1 的個(gè)數(shù)](https://leetcode.cn/problems/max-consecutive-ones/description/)
      • 2006.差的絕對(duì)值為K的數(shù)對(duì)題目
      • [1464. 數(shù)組中兩元素的最大乘積](https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array/description/)
      • [2535. 數(shù)組元素和與數(shù)字和的絕對(duì)差](https://leetcode.cn/problems/difference-between-element-sum-and-digit-sum-of-an-array/description/)
      • [2656. K 個(gè)元素的最大和](https://leetcode.cn/problems/maximum-sum-with-exactly-k-elements/description/)
      • [2367. 算術(shù)三元組的數(shù)目](https://leetcode.cn/problems/number-of-arithmetic-triplets/description/)
      • [27. 移除元素](https://leetcode.cn/problems/remove-element/description/)
      • [1920. 基于排列構(gòu)建數(shù)組](https://leetcode.cn/problems/build-array-from-permutation/description/)
      • [1929. 數(shù)組串聯(lián)](https://leetcode.cn/problems/concatenation-of-array/description/)
      • [1431. 擁有最多糖果的孩子](https://leetcode.cn/problems/kids-with-the-greatest-number-of-candies/description/)
      • [1991. 找到數(shù)組的中間位置](https://leetcode.cn/problems/find-the-middle-index-in-array/description/)
      • [540. 有序數(shù)組中的單一元素](https://leetcode.cn/problems/single-element-in-a-sorted-array/description/)
      • [119. 楊輝三角 II](https://leetcode.cn/problems/pascals-triangle-ii/description/)
      • [3065. 超過閾值的最少操作數(shù) I](https://leetcode.cn/problems/minimum-operations-to-exceed-threshold-value-i/description/)
      • [2951. 找出峰值](https://leetcode.cn/problems/find-the-peaks/description/)
      • [2960. 統(tǒng)計(jì)已測(cè)試設(shè)備](https://leetcode.cn/problems/count-tested-devices-after-test-operations/description/)
      • [2824. 統(tǒng)計(jì)和小于目標(biāo)的下標(biāo)對(duì)數(shù)目](https://leetcode.cn/problems/count-pairs-whose-sum-is-less-than-target/description/)
      • [2859. 計(jì)算 K 置位下標(biāo)對(duì)應(yīng)元素的和](https://leetcode.cn/problems/sum-of-values-at-indices-with-k-set-bits/description/)
      • [2341. 數(shù)組能形成多少數(shù)對(duì)](https://leetcode.cn/problems/maximum-number-of-pairs-in-array/description/)
      • [3158. 求出出現(xiàn)兩次數(shù)字的 XOR 值](https://leetcode.cn/problems/find-the-xor-of-numbers-which-appear-twice/description/)

順序表

杭州電子科技大學(xué)在線評(píng)測(cè)

杭州電子科技大學(xué)在線評(píng)測(cè)官網(wǎng)

2008 數(shù)值統(tǒng)計(jì)

#include <iostream>
using namespace std;int main()
{int n;while (cin >> n) {if (n == 0) {break;}int negative = 0;int zero = 0;int positive = 0;for (int i = 1; i <= n; i++) {double num;cin >> num;if (num < 0) {negative++;}if (num == 0) {zero++;}if (num > 0) {positive++;}}cout << negative << ' ' << zero << ' ' << positive << endl;}
}
使用順序表實(shí)現(xiàn)
#include <iostream>
using namespace std;// 順序表模板
#define eleType doublestruct SequentialList {eleType *elements;int size;int capacity;
};// 初始化順序表
void initializeList(SequentialList* list, int capacity) {list->elements = new eleType[capacity];list->size = 0;list->capacity = capacity;
}// 銷毀順序表
void destroyList(SequentialList* list) {delete[] list->elements;
}// 獲取順序表的大小
eleType size(SequentialList* list) {return list->size;
}// 判斷順序表是否為空
eleType isEmpty(SequentialList* list) {return list->size == 0;
}// 順序表的元素插入
eleType insert(SequentialList* list, int index, eleType element) {if (index < 0 || index > list->size) {throw std::invalid_argument("Invalid index");}if (list->size == list->capacity) {int newCapacity = list->capacity * 2;eleType* newElements = new eleType[newCapacity];for (int i = 0; i < list->size; ++i) {newElements[i] = list->elements[i];}delete[] list->elements;list->elements = newElements;list->capacity = newCapacity;}for (int i = list->size; i > index; i--) {list->elements[i] = list->elements[i - 1];}list->elements[index] = element;list->size++;
}// 順序表的元素刪除
void deleteElement(SequentialList* list, int index) {if (index < 0 || index >= list->size) {throw std::invalid_argument("Invalid index");}for (int i = index; i < list->size - 1; ++i) {list->elements[i] = list->elements[i + 1];}list->size--;
}// 順序表尋找元素是否存在
eleType findElement(SequentialList* list, eleType element) {for (int i = 0; i < list->size; ++i) {if (list->elements[i] == element) {return i;}}return -1;
}// 獲取元素
eleType getElement(SequentialList* list, int index) {if (index < 0 || index >= list->size) {throw std::invalid_argument("Invalid index");}return list->elements[index];
}// 修改元素
void updateElement(SequentialList* list, int index, eleType value) {if (index < 0 || index >= list->size) {throw std::invalid_argument("Invalid index");}list->elements[index] = value;
}int main()
{int n;while (cin >> n && n) {SequentialList s;initializeList(&s, 1);for (int i = 0; i < n; i++) {eleType x;cin >> x;insert(&s, i, x);}int pcnt = 0, zcnt = 0, ncnt = 0;for (int i = 0; i < size(&s); i++) {eleType element = getElement(&s, i);if (element > 1e-8) {pcnt++;}else if (element < -1e-8) {ncnt++;}else {zcnt++;}}cout << ncnt << ' ' << zcnt << ' ' << pcnt << endl;}
}

2014 青年歌手大獎(jiǎng)賽_評(píng)委會(huì)打分

#include <iostream>
using namespace std;// 順序表模板
#define eleType doublestruct SequentialList {eleType* elements;int size;int capacity;
};// 初始化順序表
void initializeList(SequentialList* list, int capacity) {list->elements = new eleType[capacity];list->size = 0;list->capacity = capacity;
}// 銷毀順序表
void destroyList(SequentialList* list) {delete[] list->elements;
}// 獲取順序表的大小
int size(SequentialList* list) {return list->size;
}// 判斷順序表是否為空
eleType isEmpty(SequentialList* list) {return list->size == 0;
}// 順序表的元素插入
void insert(SequentialList* list, int index, eleType element) {if (index < 0 || index > list->size) {throw std::invalid_argument("Invalid index");}if (list->size == list->capacity) {int newCapacity = list->capacity * 2;eleType* newElements = new eleType[newCapacity];for (int i = 0; i < list->size; ++i) {newElements[i] = list->elements[i];}delete[] list->elements;list->elements = newElements;list->capacity = newCapacity;}for (int i = list->size; i > index; i--) {list->elements[i] = list->elements[i - 1];}list->elements[index] = element;list->size++;
}// 順序表的元素刪除
void deleteElement(SequentialList* list, int index) {if (index < 0 || index >= list->size) {throw std::invalid_argument("Invalid index");}for (int i = index; i < list->size - 1; ++i) {list->elements[i] = list->elements[i + 1];}list->size--;
}// 順序表尋找元素是否存在
eleType findElement(SequentialList* list, eleType element) {for (int i = 0; i < list->size; ++i) {if (list->elements[i] == element) {return i;}}return -1;
}// 獲取元素
eleType getElement(SequentialList* list, int index) {if (index < 0 || index >= list->size) {throw std::invalid_argument("Invalid index");}return list->elements[index];
}// 修改元素
void updateElement(SequentialList* list, int index, eleType value) {if (index < 0 || index >= list->size) {throw std::invalid_argument("Invalid index");}list->elements[index] = value;
}int main()
{int n;while (cin >> n) {SequentialList s;initializeList(&s, n);eleType max_score = -100000000;eleType min_score = 100000000;eleType sum = 0;for (int i = 0; i < n; i++) {eleType num;cin >> num;insert(&s, i, num);}for (int i = 0; i < size(&s); i++) {if (getElement(&s, i) > max_score) {max_score = getElement(&s, i);}if (getElement(&s, i) < min_score) {min_score = getElement(&s, i);}sum += getElement(&s, i);}sum -= max_score;sum -= min_score;printf("%.2f\n", sum / (n - 2));}
}

Leetcode題目

LCP 01. 猜數(shù)字

class Solution {
public:int game(vector<int>& guess, vector<int>& answer) {int count = 0;for(int i = 0; i < 3; i++) {if(guess[i] == answer[i]) {count++;}}return count;}
};

LCP 06. 拿硬幣

class Solution {
public:int minCount(vector<int>& coins) {int count = 0;for(int i = 0; i < coins.size(); i++) {count += (coins[i] + 1)/2;}return count;}
};

2057. 值相等的最小索引

class Solution {
public:int smallestEqual(vector<int>& nums) {for(int i = 0; i < nums.size(); i++) {if(i % 10 == nums[i]) {return i;}}return -1;}
};

485. 最大連續(xù) 1 的個(gè)數(shù)

class Solution {
public:int findMaxConsecutiveOnes(vector<int>& nums) {int count = 0;int end = 0;for(int i = 0; i < nums.size(); i++) {if(nums[i] == 1) {count = count + 1;if(count > end) {end = count;}} else {count = 0;}}return end;}
};

2006.差的絕對(duì)值為K的數(shù)對(duì)題目

class Solution {
public:int countKDifference(vector<int>& nums, int k) {int count = 0;for(int i = 0; i < nums.size(); i++) {for(int j = i + 1; j < nums.size(); j++) {if(abs(nums[i] - nums[j]) == k) {count++;}}}return count;}
};

1464. 數(shù)組中兩元素的最大乘積

class Solution {
public:int maxProduct(vector<int>& nums) {int maxIndex = 0;for(int i = 0; i < nums.size(); i++) {if(nums[i] > nums[maxIndex]) {maxIndex = i;}}int secMaxIndex = -1;for(int i = 0; i < nums.size(); i++) {if(i != maxIndex) {if(secMaxIndex == -1 || nums[i] > nums[secMaxIndex]) {secMaxIndex = i;}}}return (nums[maxIndex] - 1) * (nums[secMaxIndex] - 1);}
};

2535. 數(shù)組元素和與數(shù)字和的絕對(duì)差

class Solution {
public:int differenceOfSum(vector<int>& nums) {int x = 0, y = 0;for(int i = 0; i < nums.size(); i++) {x += nums[i];while(nums[i]) {y += nums[i] % 10;nums[i] = nums[i] / 10;}}return abs(x - y);}
};

2656. K 個(gè)元素的最大和

class Solution {
public:int maximizeSum(vector<int>& nums, int k) {int count = 0;while(k--) {int maxIndex = 0;for(int i = 0; i < nums.size(); i++) {if(nums[i] > nums[maxIndex]) {maxIndex = i;}}count += nums[maxIndex];nums[maxIndex] += 1;}return count;}
};

2367. 算術(shù)三元組的數(shù)目

class Solution {
public:int arithmeticTriplets(vector<int>& nums, int diff) {int count = 0;for(int i = 0; i < nums.size(); i++) {for(int j = i + 1; j < nums.size(); j++) {if(nums[j] - nums[i] == diff) {for(int k = j + 1; k < nums.size(); k++) {if(nums[k] - nums[j] == diff) {count++;}}}}}return count;}
};

27. 移除元素

class Solution {
public:int removeElement(vector<int>& nums, int val) {int l = 0;int r = nums.size() - 1;while(l <= r) {if (nums[l] == val) {int temp = nums[l];nums[l] = nums[r];nums[r] = temp;r--;} else {l++;}}return r + 1;}
};

1920. 基于排列構(gòu)建數(shù)組

class Solution {
public:vector<int> buildArray(vector<int>& nums) {vector<int> result;for(int i = 0; i < nums.size(); i++) {int ans = nums[nums[i]];result.push_back(ans);}return result;}
};

1929. 數(shù)組串聯(lián)

class Solution {
public:vector<int> getConcatenation(vector<int>& nums) {vector<int> result;for(int i = 0; i < nums.size(); i++) {result.push_back(nums[i]);}for(int i = 0; i < nums.size(); i++) {result.push_back(nums[i]);}return result;}
};

1431. 擁有最多糖果的孩子

class Solution {
public:vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {vector<bool> result;for(int i = 0; i < candies.size(); i++) {int maxIndex = 0;candies[i] += extraCandies;for(int j = 0; j < candies.size(); j++) {if(candies[j] > candies[maxIndex]) {maxIndex = j;}}if(candies[i] == candies[maxIndex]) {result.push_back(true);} else {result.push_back(false);}candies[i] -= extraCandies;}return result;}
};

1991. 找到數(shù)組的中間位置

class Solution {
public:int findMiddleIndex(vector<int>& nums) {for(int i = 0; i < nums.size(); i++) {int l = 0;int r = 0;for(int j = 0; j < i; j++) {l += nums[j];}for(int j = i + 1; j < nums.size(); j++) {r += nums[j];}if (l == r) {return i;}}return -1;}
};

540. 有序數(shù)組中的單一元素

class Solution {
public:int singleNonDuplicate(vector<int>& nums) {for(int i = 0; i < nums.size(); i++) {if(i == 0) {if(nums.size() == 1 || nums[i] != nums[i + 1]) {return nums[i];}} else if(i == nums.size() - 1) {if(nums[i] != nums[i - 1]) {return nums[i];}} else {if(nums[i - 1] != nums[i] && nums[i] != nums[i + 1]) {return nums[i];}}}return 0;}
};

119. 楊輝三角 II

class Solution {
public:vector<int> getRow(int rowIndex) {int nums[34][34];for(int i = 0; i <= rowIndex; i++) {for(int j = 0; j <= i; j++) {if(j == 0 || i == j) {nums[i][j] = 1;} else {nums[i][j] = nums[i-1][j] + nums[i-1][j-1];}}}vector<int> result;for(int j = 0; j <= rowIndex; j++) {result.push_back(nums[rowIndex][j]);}return result;}
};

3065. 超過閾值的最少操作數(shù) I

class Solution {
public:int minOperations(vector<int>& nums, int k) {int count = 0;for(int i = 0; i < nums.size(); i++) {if(nums[i] < k) {count++;}}return count;}
};

2951. 找出峰值

class Solution {
public:vector<int> findPeaks(vector<int>& mountain) {vector<int> result;for(int i = 1; i < mountain.size() - 1; i++) {if((mountain[i] > mountain[i - 1]) && (mountain[i] > mountain[i + 1])) {result.push_back(i);}}return result;}
};

2960. 統(tǒng)計(jì)已測(cè)試設(shè)備

class Solution {
public:int countTestedDevices(vector<int>& batteryPercentages) {int count = 0;for(int i = 0; i < batteryPercentages.size(); i++) {if(batteryPercentages[i] > 0) {count++;for(int j = i + 1; j < batteryPercentages.size(); j++) {batteryPercentages[j] = max(0, batteryPercentages[j] - 1);}}}return count;}
};

2824. 統(tǒng)計(jì)和小于目標(biāo)的下標(biāo)對(duì)數(shù)目

class Solution {
public:int countPairs(vector<int>& nums, int target) {int count = 0;for(int i = 0; i < nums.size(); i++) {for(int j = i + 1; j < nums.size(); j++) {if(nums[i] + nums[j] < target) {count++;}}}return count;}
};

2859. 計(jì)算 K 置位下標(biāo)對(duì)應(yīng)元素的和

class Solution {
public:int sumIndicesWithKSetBits(vector<int>& nums, int k) {int sum = 0;for(int i = 0; i < nums.size(); i++) {int num = i;int count = 0;while(num) {if(num & 1) {count++;}num >>= 1;}if(count == k) {sum += nums[i];}}return sum;}
};

2341. 數(shù)組能形成多少數(shù)對(duì)

class Solution {
public:vector<int> numberOfPairs(vector<int>& nums) {int count = 0;bool judge[100] = {0};for(int i = 0; i < nums.size(); i++) {for(int j = 0; j < i; j++) {if(judge[j] == true) {continue;}if(nums[i] == nums[j]) {judge[i] = judge[j] = true;count++;break;}}}return {count, (int)nums.size() - 2 * count};}
};

3158. 求出出現(xiàn)兩次數(shù)字的 XOR 值

class Solution {
public:int duplicateNumbersXOR(vector<int>& nums) {int count = 0;long visited = 0;for(int i = 0; i < nums.size(); i++) {int x = nums[i];if(visited & ((long)1<<x)) {count ^= x;} else {visited |= ((long)1<<x);}}return count;}
};
http://www.risenshineclean.com/news/48548.html

相關(guān)文章：

  • 商務(wù)部直銷行業(yè)管理信息系統(tǒng)西安網(wǎng)站seo排名優(yōu)化
  • 作弊網(wǎng)站網(wǎng)站開發(fā)建設(shè)步驟
  • 個(gè)人做的小網(wǎng)站需要備案網(wǎng)絡(luò)推廣銷售是做什么的
  • 公司做網(wǎng)站要注意什么seo需要培訓(xùn)才能找到工作嗎
  • 網(wǎng)站優(yōu)化軟件排名器怎么創(chuàng)建網(wǎng)頁鏈接
  • 網(wǎng)站日均ip過萬怎么做最佳磁力搜索引擎
  • 河長(zhǎng)制網(wǎng)站建設(shè)希愛力雙效片的作用與功效
  • 網(wǎng)站建設(shè)報(bào)價(jià)方案對(duì)比seo招聘要求
  • 自助網(wǎng)站建設(shè)怎么建設(shè)口碑營銷案例簡(jiǎn)短
  • wix怎么做網(wǎng)站引流推廣效果好的app
  • 網(wǎng)站建設(shè)公司廣告語蘇州網(wǎng)站制作開發(fā)公司
  • 網(wǎng)站優(yōu)化千牛幫濟(jì)南全網(wǎng)推廣
  • 成都建站優(yōu)化公司合肥seo網(wǎng)站管理
  • 做公司網(wǎng)站報(bào)價(jià)亞馬遜跨境電商
  • 福州企業(yè)網(wǎng)站建設(shè)國內(nèi)快速建站
  • wordpress源碼閱讀知乎關(guān)鍵詞優(yōu)化軟件
  • 網(wǎng)站分站作用網(wǎng)站推廣的目的
  • 網(wǎng)站圖片大小愛站網(wǎng)關(guān)鍵詞搜索工具
  • 可以做網(wǎng)站首頁的圖片素材辦公軟件培訓(xùn)
  • 做團(tuán)購網(wǎng)站的心得廣東今日最新疫情通報(bào)
  • 幫助傳銷做網(wǎng)站違法嗎市場(chǎng)推廣的方法和規(guī)劃
  • 做網(wǎng)站紙張大小合肥網(wǎng)絡(luò)關(guān)鍵詞排名
  • 網(wǎng)站開發(fā)工作職責(zé)汽車軟文廣告
  • windows2008網(wǎng)站百度新聞首頁新聞全文
  • 創(chuàng)建網(wǎng)站要多長(zhǎng)時(shí)間在線培訓(xùn)平臺(tái)有哪些
  • 淘寶做個(gè)網(wǎng)站多少錢最新國際新聞熱點(diǎn)事件
  • 電子商務(wù)網(wǎng)站建設(shè)有哪些流程圖網(wǎng)站友情鏈接的好處
  • 網(wǎng)站寬度 自動(dòng)收縮微信公眾號(hào)怎么創(chuàng)建
  • 呼和浩特網(wǎng)站建設(shè)費(fèi)用網(wǎng)絡(luò)快速推廣渠道
  • 響應(yīng)式 網(wǎng)站建設(shè)seo系統(tǒng)培訓(xùn)班