#include using namespace std; /*每趟排序把最大的元素放到最后 这种写法的比较规则是相邻元素*/ void bubble_sort1(std:...
#include using namespace std; /*每趟排序把最大的元素放到最后 这种写法的比较规则是相邻元素*/ void bubble_sort1(std:...
题目:https://www.nowcoder.com/practice/fae8632cfc64433989720bc01e09f382?tpId=90&tqId=3080...
题目:https://www.nowcoder.com/practice/de7d4a4b50f643669f331941afb1e728?tpId=90&tqId=3080...
题目:https://www.nowcoder.com/practice/872919272a33406a9c5ddc8b2f7532f4?tpId=90&tqId=3080...
题目:https://www.nowcoder.com/practice/d9f5dbd3b57d450e8406e102573d4bdd?tpId=90&tqId=3080...
题目:https://www.nowcoder.com/practice/4f356b0618d14737a6f3782771bb4079?tpId=90&tqId=3079...
题目:https://www.nowcoder.com/practice/826c2f28ee2a414cac87eb0304eca1a0?tpId=90&tqId=3079...
题目:https://www.nowcoder.com/practice/563c6a69fd714e59a942d97047cedcb3?tpId=90&tqId=3079...
题目:https://www.nowcoder.com/practice/9240357eefcf4d938b90bdd5eec3712b?tpId=90&tqId=3079...
题目:https://www.nowcoder.com/practice/e496d8e885a949d18476b2dea1e594a9?tpId=90&tqId=3079...
题目:https://www.nowcoder.com/practice/4802faa9afb54e458b93ed372e180f5c?tpId=90&tqId=3079...
题目:https://www.nowcoder.com/practice/cc929a2ed85f4f49b834e6e301fba77b?tpId=90&tqId=3079...
题目:https://www.nowcoder.com/practice/c4ea1f2263434861aef111aa44a5b064?tpId=90&tqId=3079...
题目:https://www.nowcoder.com/practice/ce5b35929ab84e3a806886d9667be00a?tpId=90&tqId=3079...
#include using namespace std; /*旋转hash(Rabin-Karp算法)实现字符串匹配 *基本原理:把每个字符当做数字对待,这样字符串就是一串...
题目:https://www.nowcoder.com/practice/ab900f183e054c6d8769f2df977223b5?tpId=90&tqId=3078...
题目:https://www.nowcoder.com/practice/49375dd6a42d4230b0dc4ea5a2597a9b?tpId=90&tqId=3078...
题目:https://www.nowcoder.com/practice/24575008c6134b6fa4fab8ea0ea82a99?tpId=90&tqId=3078...
#include #include using namespace std; int func(vector &height){ int n = height.size()...
#include using namespace std; bool IsPrime(int x){ if(x == 2 || x == 3) return true; if...