zzy296753977的博客

题目链接：https://leetcode-cn.com/problems/friend-circles/submissions/#include<stdio.h>#include<malloc.h>// 记录朋友圈是否被找过int* visited;// bfs的作用就是把对应那行的朋友圈关系找出来并且找过的关系置为2void bfs(int** M, i...

题目链接：https://leetcode-cn.com/problems/number-of-islands/submissions/#include<stdio.h>// 方向分别对应上下左右int directon[4][2] = { {0, 1}, {0, -1}, {-1, 0}, {1, 0} };// dfs的作用就是把一个岛屿的所有点全部给置2void d...

#include<stdio.h>#include<string.h>#include<ctype.h>void Swap(char* para1, char* para2);void ReverseWord(char* word, int head, int tail);char* reverseWords(char* s);int main...

字符串去除出现最少次数的字符#include<stdio.h>#include<string.h>int main(){ char input[20]; int letters[26] = {0}; int min = 1; while (scanf("%s",input) != EOF) { unsigned lon...

c语言#include <stdio.h>#include <string.h>#include <stdlib.h>#define MAX_LEN 100void func(char* input) { int len = strlen(input); int start = 0; int end = 7; while (end <= ...

字符串反转#include<stdio.h>#include<cstring>void reverse(const char* str);int main() { // 处理输入的字符串 char str[100]; while (scanf_s("%s", str, 100) != EOF) { reverse(str); } return 0;}...

找32位整数中二进制1的个数#include<stdio.h>#include<string.h>#include<malloc.h>int count(int n);int main() { int n; while (scanf("%d", &n) != EOF) { printf("%d", count(n)); } retu...

旋转二维数组#include<stdio.h>#include<string.h>#include<malloc.h>/* * Function:对二维数组进行顺时针旋转和逆时针旋转输出 * Input:二维度数组 * Return:void */int main() { //动态二维数组输入 int row, col; while (s...

全排列递归算法（DFS）#include<stdio.h>#include<malloc.h>void perm(int* list, int k, int n);void swap(int* x, int* y);void show(int* list, int n);int main() { int* list = (int*)malloc(3 * siz...

1.冒泡排序：比较相邻的元素。如果第一个比第二个大，就交换他们两个。对每一对相邻元素作同样的工作，从开始第一对到结尾的最后一对。在这一点，最后的元素应该会是最大的数。针对所有的元素重复以上的步骤，除了最后一个。持续每次对越来越少的元素重复上面的步骤，直到没有任何一对数字需要比较。        /** * 冒泡排序 * @param 排序前数组a */ public void Bub...

第一题：输入一串数字，奇数升序，偶数降序排列#include&lt;iostream&gt;using namespace std;//输入一串数字，奇数升序，偶数降序排列bool numberJudge(int n);void bubbleSort(int * num, int n);void quickSort(int *num, int left, int right);int ...