编程能力测试准备

elipse调试技巧

https://blog.csdn.net/bin25/article/details/78079558

https://blog.csdn.net/swebin/article/details/70598978

Scanner控制台输入输出数据

https://blog.csdn.net/guizhaiteng/article/details/79657583

https://blog.csdn.net/qq_18293213/article/details/54947557

I/O操作

https://www.cnblogs.com/zhaoyanjun/p/6292384.html

https://blog.csdn.net/zhangbinu/article/details/51362612

java API

Java优先队列  https://mp.csdn.net/postedit/83317209

JavaStringBuffer常用的操作 https://mp.csdn.net/postedit/83312973

BigData https://mp.csdn.net/postedit/83338298

使用 BufferedReader 和 BufferedWriter 读取和写入数据 https://mp.csdn.net/postedit/83352747

String常用操作 https://mp.csdn.net/postedit/83311370

java获取时间操作 https://mp.csdn.net/postedit/83316879

生成随机数https://blog.csdn.net/anhuibozhoushatu/article/details/83374302

java获取时间,统计程序运行时间https://mp.csdn.net/postedit/83316879

序列化操作

https://blog.csdn.net/anhuibozhoushatu/article/details/83380797

常用的正则表达式

界面设计

注释

数据结构

数组

字符串

链表

链表的基本操作-增删查逆序  https://blog.csdn.net/anhuibozhoushatu/article/details/83628098

队列

实现队列-数组、链表、list  https://blog.csdn.net/anhuibozhoushatu/article/details/83648701

java优先队列的使用(包括重写比较函数)https://blog.csdn.net/anhuibozhoushatu/article/details/83784990

栈的实现-数组、list、链表 https://blog.csdn.net/anhuibozhoushatu/article/details/83649831

括号匹配  https://blog.csdn.net/anhuibozhoushatu/article/details/83820990

栈-行编辑程序 https://blog.csdn.net/anhuibozhoushatu/article/details/83827973

表达式计算-表达式求值-中序表达式转换成后序表达式然后求值 https://blog.csdn.net/anhuibozhoushatu/article/details/83823948

稀疏有向图求最短路径 https://blog.csdn.net/anhuibozhoushatu/article/details/83685611

稀疏图的表示G&地杰斯特拉求解单源最短路径 https://blog.csdn.net/anhuibozhoushatu/article/details/83684449

Floyd-Warshall算法 https://blog.csdn.net/anhuibozhoushatu/article/details/83793575

带有负权值的单源最短路径-bellman-ford算法 https://blog.csdn.net/anhuibozhoushatu/article/details/83795607

SPFA算法求解最短路径(改进Bellman-ford) https://blog.csdn.net/anhuibozhoushatu/article/details/83796658

三元组实现矩阵的加法和减法(未除去0) https://blog.csdn.net/anhuibozhoushatu/article/details/83659319

并查集(求解联通图) https://blog.csdn.net/anhuibozhoushatu/article/details/83307482

并查集-畅通工程2(最小生成树)https://blog.csdn.net/anhuibozhoushatu/article/details/83994188

并查集-畅通工程 https://blog.csdn.net/anhuibozhoushatu/article/details/83993420

最小生成树-适合稠密矩阵的prime算法 https://blog.csdn.net/anhuibozhoushatu/article/details/83789707

最小生成树-适合稀疏矩阵的kruskal算法 https://blog.csdn.net/anhuibozhoushatu/article/details/83994188

优先队列实现哈夫曼树-先序遍历&中序遍历&后序遍历 https://blog.csdn.net/anhuibozhoushatu/article/details/83817150

给定一组数据构建二叉树 https://blog.csdn.net/anhuibozhoushatu/article/details/83689569

二叉树的前序中序后序 遍历 递归和非递归  https://blog.csdn.net/anhuibozhoushatu/article/details/83688623

对于给定的先序和中旬或者中序和后序重建树 https://blog.csdn.net/anhuibozhoushatu/article/details/83820445

模拟题专项

算法

狄杰斯特拉 https://blog.csdn.net/anhuibozhoushatu/article/details/83306884

冒泡排序

快速排序

插入排序

DFS

BFS

https://blog.csdn.net/REfusing/article/details/80600210

枚举

二分查找https://blog.csdn.net/anhuibozhoushatu/article/details/83541308

思想

1.贪心

2.动态规划

3.递归 递归经典题目-移动汉诺塔 https://www.cnblogs.com/dmego/p/5965835.html

 https://blog.csdn.net/anhuibozhoushatu/article/details/83828598

全排列-递归去重复实现-非DFS https://blog.csdn.net/anhuibozhoushatu/article/details/83870565

全排列-递归(不含重复的操作)非DFS https://blog.csdn.net/anhuibozhoushatu/article/details/83869789

一些边界问题

常见代码失误bug

常见题目

排序

插入排序 java https://blog.csdn.net/anhuibozhoushatu/article/details/83306699

快速排序 java https://blog.csdn.net/anhuibozhoushatu/article/details/83306790

冒泡排序 java https://blog.csdn.net/anhuibozhoushatu/article/details/83586746

归并排序Java https://blog.csdn.net/anhuibozhoushatu/article/details/83306827

选择排序 https://blog.csdn.net/anhuibozhoushatu/article/details/83306748

堆排序 https://blog.csdn.net/anhuibozhoushatu/article/details/83590333

拓扑排序 https://blog.csdn.net/anhuibozhoushatu/article/details/83713277

[poj1094]拓扑排序经典例题 https://blog.csdn.net/anhuibozhoushatu/article/details/83716215

拓扑排序-List graph[]实现 https://blog.csdn.net/anhuibozhoushatu/article/details/83758394

拓扑排序使用List<List>存储关系,即稀疏矩阵 https://blog.csdn.net/anhuibozhoushatu/article/details/83749404

拓扑排序-判断有无环或者有无点无法区分先后顺序 https://blog.csdn.net/anhuibozhoushatu/article/details/83743756

成绩排序1https://blog.csdn.net/anhuibozhoushatu/article/details/83381644

BFS

迷宫求解并打印最短路径https://blog.csdn.net/anhuibozhoushatu/article/details/83306485

DFS

DFS全排列(List),并有去重(Set)https://blog.csdn.net/anhuibozhoushatu/article/details/83306587

八皇后问题-DFS深度搜索-递归 https://blog.csdn.net/anhuibozhoushatu/article/details/83307197

八皇后问题 https://blog.csdn.net/anhuibozhoushatu/article/details/83335928

穷举一个字符串的子序列 https://blog.csdn.net/anhuibozhoushatu/article/details/83533631

暴力

暴力-最大矩形面积 https://blog.csdn.net/anhuibozhoushatu/article/details/83540716

动态规划

最大连续子数组和https://blog.csdn.net/anhuibozhoushatu/article/details/83307766

骑士

动态规划-硬币找零问题四种情况https://blog.csdn.net/anhuibozhoushatu/article/details/83536108

最长递增子序列https://blog.csdn.net/anhuibozhoushatu/article/details/83506784

最长公共子序列https://blog.csdn.net/anhuibozhoushatu/article/details/83500943

01背包问题https://blog.csdn.net/anhuibozhoushatu/article/details/83443225

动态规划-开心的金明 https://blog.csdn.net/anhuibozhoushatu/article/details/83663672

演讲大厅安排https://blog.csdn.net/anhuibozhoushatu/article/details/83540716

动态规划-Best Time to Buy and Sell Stock  https://mp.csdn.net/postedit/83579170

动态规划-对抗赛 https://blog.csdn.net/anhuibozhoushatu/article/details/83540027

动态规划-和为sum的方法数 https://blog.csdn.net/anhuibozhoushatu/article/details/83538347

动态规划-最小花费 https://blog.csdn.net/anhuibozhoushatu/article/details/83624966

动态规划-数字三角形最小路径和问题https://blog.csdn.net/anhuibozhoushatu/article/details/83618641

动态规划-递归-递推Unique Binary Search Trees https://blog.csdn.net/anhuibozhoushatu/article/details/83617219

贪心

最大数https://blog.csdn.net/anhuibozhoushatu/article/details/83307886

背包问题可切割https://blog.csdn.net/anhuibozhoushatu/article/details/83307541

演讲大厅安排https://blog.csdn.net/anhuibozhoushatu/article/details/83540716

贪心算法-Best Time to Buy and Sell Stock II https://blog.csdn.net/anhuibozhoushatu/article/details/83579170

Jump Game II https://blog.csdn.net/anhuibozhoushatu/article/details/83573791

区间贪心 https://blog.csdn.net/anhuibozhoushatu/article/details/83572835

贪心算法-过河问题 https://blog.csdn.net/anhuibozhoushatu/article/details/83545780

贪心算法-多机调度问题 https://blog.csdn.net/anhuibozhoushatu/article/details/83545457

贪心算法-选择不相交区间问题 https://blog.csdn.net/anhuibozhoushatu/article/details/83543070

贪心算法-最优装载问题 https://blog.csdn.net/anhuibozhoushatu/article/details/83541470

贪心算法-均分纸牌 https://blog.csdn.net/anhuibozhoushatu/article/details/83307732

穷举

玛雅人的密码https://blog.csdn.net/anhuibozhoushatu/article/details/83420054

假币-枚举 https://blog.csdn.net/anhuibozhoushatu/article/details/83307340

递推

整数拆分https://blog.csdn.net/anhuibozhoushatu/article/details/83385472

模拟专项

大数相乘https://blog.csdn.net/anhuibozhoushatu/article/details/83337657

简单模拟-特殊乘法 https://blog.csdn.net/anhuibozhoushatu/article/details/83621836

模拟-手机键盘 https://blog.csdn.net/anhuibozhoushatu/article/details/83620708

矩阵乘法 https://blog.csdn.net/anhuibozhoushatu/article/details/83307696

数学

球的半径和体积https://blog.csdn.net/anhuibozhoushatu/article/details/83386786

其他

逆序运算

吃水果

回文数 三种解法https://blog.csdn.net/anhuibozhoushatu/article/details/83306967

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值