自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

小堃哥的专栏

写博客:网址链接+名称:oj名+所用算法名称+该题注意事项和心得

  • 博客(10)
  • 资源 (1)
  • 收藏
  • 关注

原创 leetcode+链表+移除所有的重复项

点击打开链接#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string>#include<cstring>#include<string.h>#include<math.h>#include<algorithm

2018-02-24 22:33:01 137

原创 leetcode+二分搜索查找,但是有重复数据有点不一样

点击打开链接#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string>#include<cstring>#include<string.h>#include<math.h>#include<algorithm

2018-02-24 22:30:11 309

原创 leetcode+标记数据最多只能两次,多余去掉

点击打开链接#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string>#include<cstring>#include<string.h>#include<math.h>#include<algorithm

2018-02-24 22:25:55 173

原创 leetcode+wordsearch+找到首字母,然后上下左右DFS回溯搜索

点击打开链接#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string>#include<cstring>#include<string.h>#include<math.h>#include<algorithm

2018-02-24 22:21:46 368

原创 leetcode+两个一维数组标记就好

点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9

2018-02-01 16:30:14 143

原创 leetcode+二分。先横坐标后纵坐标

点击打开链接//二分,先横坐标二分,然后再纵坐标二分。#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f

2018-02-01 16:29:06 323

原创 leetcode+linux路径简化,stringstream是个好东西

点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9

2018-02-01 16:26:54 405

原创 leetcode+ DP方程,想出来啦

点击打开链接// Dp[m][n]表示(0,0)到(m,n)最近步数。Dp[i][j]=min(Dp[i-1][j],Dp[i][j-1])+grid[i][j]#include#include#include#include#include#include#include#include#include#include#include#include#include#

2018-02-01 16:25:20 144

原创 leetcode+DP很经典的

点击打开链接//DP[m][n]表示(0,0)到(m,n)的走法总数,方程:DP[m][n]=DP[m-1][n]+DP[m][n-1]#include#include#include#include#include#include#include#include#include#include#include#include#include#include#defi

2018-02-01 16:21:22 556

原创 leetcode+调用c++的next_permutation即可

点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x3f3f3f3f#define mod 1e9+7using

2018-02-01 16:19:08 206

c语言版贪吃蛇

很好的一个源代码,相当不错

2014-01-24

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除