![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
让编程成为习惯
kingyata
这个作者很懒,什么都没留下…
展开
-
C1001:二分查找
#includebool binarySearch(int length,int* a,int goal);int main(){ int a[50000]={0},b[50000]={0}; int length=0,number=0; int i=0; scanf("%d",&length); for(i=0;i {原创 2016-04-07 17:20:26 · 324 阅读 · 0 评论 -
1003快速排序
我第一次写的快排:运行程序时发现可以,但是程序会超时#includevoid qsort(int low,int high,int *a);int main(){int a[10000]={0};int n=0,i=0;scanf("%d",&n);for(i=0;i<n;i++)scanf("%d",a[i]);qsort(0,n-1,a);for(i=0;i<n原创 2016-04-11 23:55:18 · 367 阅读 · 0 评论 -
Daily Coding [1/60]
1. 二叉树的最短路径1.1 题目描述Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node…1.2 广度优先搜索(层次遍历)题...原创 2019-07-22 01:01:57 · 91 阅读 · 0 评论