码迷,mamicode.com
首页 >  
搜索关键字:up    ( 7825个结果
jQuery选项卡tabulous
jQuery选项卡tabulous,jQuery,选项卡,tab标签切换代码,扁平设计,jQuery选项卡tabulous是一款支持Scale、Slide、Scale Up、Flip等效果jquery插件.中国素材网.http://www.huiyi8.com/sc/484.html
分类:Web程序   时间:2014-06-11 12:50:30    阅读次数:239
WebStorm快捷键大全
ctrl+/ 单行注释ctrl+shift+/ 块注释ctrl+shift+ +/- 展开/折叠ctrl+alt+L 格式化代码ctrl+shift+ up/down 上下移动句子Alt+回车 导入包,自动修正Ctrl+N 查找类Ctrl+Shift+N 查找文件Ctrl+Alt+L 格式化代码Ct...
分类:Web程序   时间:2014-06-11 10:57:44    阅读次数:397
一入python深似海--split
下面说说split函数的用法 def break_words(stuff): """This function will break up words for us.""" words = stuff.split(' ')#split('.',1) use '.' split one time return words def sort_words(wo...
分类:编程语言   时间:2014-06-08 18:19:21    阅读次数:336
重写actionbar的up返回按钮
@Override public boolean onOptionsItemSelected(MenuItem item) {     switch (item.getItemId()) {     // Respond to the action bar's Up/Home button     case android.R.id.home:      //这里写重写的方法 一定要retrun ...
分类:其他好文   时间:2014-06-08 10:39:02    阅读次数:278
POJ - 1324 Holedox Moving
题意:贪吃蛇的题目 思路:BFS+状态的记录,坑了无数发,#include #include #include using namespace std; const int MAXN = 500000; bool flag[8],vis[25][25],mp[21][21][16384]; int n,m,l; int xx[4]={-1,0,1,0}; // up,right,dow,left...
分类:其他好文   时间:2014-06-08 10:13:19    阅读次数:204
leetcode--Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function to...
分类:其他好文   时间:2014-06-08 01:19:29    阅读次数:320
Leetcode::Pathsum & Pathsum II
PathsumDescription:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equa...
分类:其他好文   时间:2014-06-08 01:11:46    阅读次数:395
leetcode--Unique Paths II
Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i...
分类:其他好文   时间:2014-06-08 00:33:42    阅读次数:339
Leetcode | Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?实现题。从最外圈顺时针交换,最...
分类:其他好文   时间:2014-06-07 20:33:17    阅读次数:283
leetcode--Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类:其他好文   时间:2014-06-07 16:55:09    阅读次数:173
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!