保研机试算法训练个人记录笔记

之前一直在做深度学习，现在从0开始搞算法，自我监督

冒泡排序

#include <iostream>
#include <string>
using namespace std;
int main()
{//冒泡排序
int acc[]={5,7,6,4,9,1,2,3,8};
int len = sizeof(acc)/sizeof(acc[0]);//计算数组长度
for (int i = 0; i < len - 1; i++)//一共比较 元素-1 次
{
	for (int j = 0; j < len - i - 1; j++) {//内层比较循环
		if (acc[i] > acc[i + 1]) {
			int temp = acc[i];
			acc[i] = acc[i+1];
			acc[i+1] = temp;
		}
}
}
}

哈希检索两数之和（力扣热题） 

#哈希检索两数之和
class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        l =len(nums)
        for i in range(l):
            for j in range(i+1,l):
                if(nums[i]+nums[j]==target):
                    return list([i,j])