DavidWang's Blog

简单一生，快乐一生

Android 设计模式分析一

单例模式

1. 模式介绍 模式的定义 确保某一个类只有一个实例，而且自行实例化并向整个系统提供这个实例。 模式的使用场景 确保某个类有且只有一个对象的场景，例如创建一个对象需要消耗的资源过多，如要访问 IO 和数据库等资源。 2. UML类图 角色介绍 Client : 高层客户端。 Singleton : 单例类。 3. 模式的简单实现 简单实现的介绍 单例模式是设计模式中...

Posted by DavidWang on June 2, 2016

Mac OS M安装jekyll第二篇

RVM安装jekyll

“六一快乐,由于很多同学安装通过第一篇jekyll安装不成功，因此本文将使用RVM更新系统Ruby版本安装jekyll” 步骤1 － 安装 RVM RVM 是干什么的这里就不解释了，后面你将会慢慢搞明白。 $ gpg --keyserver hkp://keys.gnupg.net --recv-keys 409B6B1796C275462A1703113804BB82D39DC...

Posted by DavidWang on June 1, 2016

Mastering Markdown

Markdown 用法介绍

Intro Markdown is a lightweight and easy-to-use syntax for styling all forms of writing on the GitHub platform. What you will learn: How the Markdown format makes styled collaborative editing...

Posted by DavidWang on May 31, 2016

Mac OS 好用的Markdown编辑工具MacDown

MacDown 介绍

MacDown Hello there! I’m MacDown, the open source Markdown editor for OS X. Let me introduce myself. Markdown and I Markdown is a plain text formatting syntax created by John Gruber, aiming t...

Posted by DavidWang on May 30, 2016

Leetcode Maximum Product of Word Lengths

Medium题目 编号318

“Leetcode是一个强大的OJ网站，很多公司的面试题目都可以在这里找到” 题目 Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assu...

Posted by DavidWang on April 19, 2016

Leetcode First Missing Positive

Hard题目 编号41

“Leetcode是一个强大的OJ网站，很多公司的面试题目都可以在这里找到” 题目 Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algori...

Posted by DavidWang on April 18, 2016

Leetcode Find the Duplicate Number

Hard题目 编号287

“Leetcode是一个强大的OJ网站，很多公司的面试题目都可以在这里找到” 题目 Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist....

Posted by DavidWang on April 14, 2016

Leetcode Missing Number

Medium题目 编号268

“Leetcode是一个强大的OJ网站，很多公司的面试题目都可以在这里找到” 题目 Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example, Given nums = [0, ...

Posted by DavidWang on April 13, 2016

Leetcode Happy Number

Easy题目 编号202

“Leetcode是一个强大的OJ网站，很多公司的面试题目都可以在这里找到” 题目 Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positive inte...

Posted by DavidWang on April 13, 2016

Leetcode Bulb Switcher

Medium题目 编号319

“Leetcode是一个强大的OJ网站，很多公司的面试题目都可以在这里找到” 题目 There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every...

Posted by DavidWang on April 13, 2016

FEATURED TAGS
Fedora Markdown Leetcode Algorithm PHP MacOS Jekyll Java Android ios Xcode Mac core-animation Tomcat Ubuntu Redis Nginx Docker Dubbo 设计模式 Spring Mybatis
ABOUT ME

爱唱歌，爱健身，准备好了吗，动起来吧。

FRIENDS