自定义博客皮肤VIP专享

*博客头图:

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

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

博客底图:

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

栏目图:

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

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

菜园子

Cufer->NJUer ->Alibaba

  • 博客(8)
  • 问答 (1)
  • 收藏
  • 关注

原创 PicWordView 图文混排自定义View

PicWordView 简介picWordView是我在金山工作时趁着闲暇功夫写的一个自定义View,当然你也可以叫它库?好吧,其实比较简单,纯粹是因为太无聊了最近。(因为工作真的很闲)设计理念这个类库是我在找寻了很多图文混排库之后写出来的,主要是我觉得他们的东西都略显麻烦,不容易上手使用,有的写的真的是一团糟,很多都是简单加载html或者自定义一个RelativeLayout做ImageView和

2017-04-28 11:46:04 494

原创 LeetCode 118. Pascal's Triangle

Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] class Solution { public: vector<

2017-04-22 01:24:30 294

原创 LeetCode 101. Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

2017-04-09 13:05:22 417

原创 LeetCode 367. Valid Perfect Square

Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in library function such as sqrt.Example 1:Input: 16 Returns: True E

2017-04-09 12:19:29 226

原创 LeetCode 27. Remove Element

Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The order

2017-04-09 12:07:29 225

原创 LeetCode 345. Reverse Vowels of a String

Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.Note: The vowels

2017-04-09 11:53:24 228

原创 LeetCode 342.Power of Four

Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: Given num = 16, return true. Given num = 5, return false.Follow up: Could you solve it without loops/re

2017-04-08 19:43:42 206

原创 LeetCode 501.Find Mode in Binary Search Tree

Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST.Assume a BST is defined as follows:The left subtree of a node contains onl

2017-04-08 19:21:07 380

空空如也

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

TA关注的人

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