关闭

Clojure Github 项目收藏

1.  clojure-blog https://github.com/baoliang/clojure-blog...
阅读(401) 评论(0)

Android滑动菜单特效实现

转载请注明出处:http://blog.csdn.net/guolin_blog/article/details/8714621 人人客户端有一个特效还是挺吸引人的,在主界面手指向右滑动,就可以将菜单展示出来,而主界面会被隐藏大部分,但是仍有左侧的一小部分同菜单一起展示。 据说人人客户端的这个特效是从facebook客户端模仿来的,至于facebook是不是又从其它地方模仿来的就不...
阅读(558) 评论(0)

Eclipse上GIT插件EGIT使用手册

出处:点击打开链接 看到大家在讨论github的使用,我用的也不多,偶尔clone一些好的源代码而已。我用的是Eclipse的插件EGit,全部操作直接在eclispe里就可以完成了,哈哈,我比较懒,官网上教的那些git clone 什么的高深操作我也不会,感觉egit还是比较好用的,所以上网搜了一个关于egit的详细操作的帖子,现在搬过来和大家一起分享一下。我找到的这个帖子的地址是:http:...
阅读(546) 评论(0)

编写你的第一个垃圾收集器

原文链接: Bob Nystrom   翻译: 伯乐在线 - deathmonkey 译文链接: http://blog.jobbole.com/53376/ 本文由 伯乐在线 - deathmonkey 翻译自 Bob Nystrom。欢迎加入技术翻译小组。转载请参见文章末尾处的要求。 伯乐在线补充:本文作者 Bob Nystrom 是 Google Dart ...
阅读(404) 评论(0)

cocos2d-x 2x 菜鸟编塔防 01 准备工作

点击打开链接 一.前言 最近在学习2dx,看了几个源码,手很是痒痒,下面跟我一下编写一个类似保卫大萝卜的塔防游戏吧。 二.不废话开始编代码。 我用的cocos2d-x 的版本是2.04 ,编辑器是vs2010.首先创建一个工程,我们取名字叫“TDgame”。 之后我们添加几个常用到的模块。   1.动画管理器,Ani...
阅读(417) 评论(0)

CODE 147: Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another expression. Some examples: ["2", "1", "+",...
阅读(473) 评论(0)

CODE 146: Max Points on a Line

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. public int maxPoints(Point[] points) { // IMPORTANT: Please reset any member data you declared...
阅读(528) 评论(0)

CODE 144: Insertion Sort List

Sort a linked list using insertion sort. public ListNode insertionSortList(ListNode head) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reus...
阅读(322) 评论(0)

CODE 145: Sort List

Sort a linked list in O(n log n) time using constant space complexity. public ListNode sortList(ListNode head) { // IMPORTANT: Please reset any member data you declared, as // the same Solutio...
阅读(437) 评论(0)

PS制作图片圆角教程

点击打开链接 最近新做了一个模板的LOGO,为了让其更具美观和平滑型因此需要把图片角部修改为圆角,PS新手不防学习一下。 1.打开PhotoShop,并找开要处理的图片; 2.使用工具栏中的"矩形"工具,并对其如下设置: 在写有"注意"字样的地方,这个按钮表示用此工具建立路径, 路径的作用也就是为了我们 [ 3.转换成选区(快捷键:Ctrl+Enter) ] ...
阅读(385) 评论(0)

CODE 143:LRU Cache

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the value (will always be positive) of the key if...
阅读(287) 评论(0)

CODE 142: Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [3,2,1]. public ArrayList pos...
阅读(365) 评论(0)

CODE 141: Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3]. Note: Recursive soluti...
阅读(321) 评论(0)

CODE 140: Reorder List

Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. For example, Given {1,2,3,4}, reorder it to {1,4...
阅读(316) 评论(0)

CODE 139: Linked List Cycle II

Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space? 点击打开链接 public ListNode detectCycle(ListNod...
阅读(392) 评论(0)

CODE 138: Linked List Cycle

Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? public boolean hasCycle(ListNode head) { // IMPORTANT: Please reset any...
阅读(384) 评论(0)

CODE 137: Word Break II

Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, given s = "...
阅读(462) 评论(0)

CODE 136: Word Break

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = "leetcode", dict = ["leet"...
阅读(519) 评论(0)

CODE 135: Copy List with Random Pointer

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. public RandomListNode copyRan...
阅读(455) 评论(0)

CODE 134: Single Number II

Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without usi...
阅读(389) 评论(0)
199条 共10页首页 上一页 1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:105599次
    • 积分:2773
    • 等级:
    • 排名:第14304名
    • 原创:178篇
    • 转载:21篇
    • 译文:0篇
    • 评论:9条
    文章分类
    最新评论