关闭

[置顶] Android中使用Movie显示gif动态图

在看这篇博文之前对attr自定义属性还是不是很熟的童鞋可以先看看:Android中attr详解(http://blog.csdn.net/u012975705/article/details/48716797)效果图 显示的事两张动态gif图实现代码1、布局activity_main.xml <LinearLayout x...
阅读(6919) 评论(4)

Andrioid进程保护

这篇博文主要是关于进程保活的应用,通过对网上各种进程保活方式的学习,自己理解后做汇总、优化、简单封装。进程保活,主要就为了加强你写的app在手机上的生存能力,降低被手机干掉的几率。当然,如果想要完全保证app不被杀死,那是不可能的(因为就是你再厉害,也厉害不过手机厂商),所以只能是尽量提高app的存活几率。下面将通过‘AIDL +JobS...
阅读(1583) 评论(0)

leetcode:144. Binary Tree Preorder Traversal

转载请注明出处:z_zhaojun的博客 原文地址 题目地址 Binary Tree Preorder TraversalGiven a binary tree, return the preorder traversal of its nodes' values.For example: Given binary tree {1,#,2,3}, return [1,2,3].思路:优先添...
阅读(1102) 评论(0)

leetcode:41. First Missing Positive (Java)

转载请注明出处:z_zhaojun的博客 原文地址 题目地址 First Missing PositiveGiven 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 algo...
阅读(1180) 评论(1)

leetcode:268. Missing Number(Java)解答

转载请注明出处:z_zhaojun的博客 原文地址 题目地址 Missing NumberGiven 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, 1, 3...
阅读(1983) 评论(0)

leetcode:122. Best Time to Buy and Sell Stock II(java)解答

转载请注明出处:z_zhaojun的博客 原文地址 题目地址 Best Time to Buy and Sell Stock IISay you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum pro...
阅读(1258) 评论(0)

leetcode:121. Best Time to Buy and Sell Stock(Java)解答

转载请注明出处:z_zhaojun的博客 原文地址 题目地址 Best Time to Buy and Sell Stock My Submissions QuestionSay you have an array for which the ith element is the price of a given stock on day i.If you were only permit...
阅读(1863) 评论(0)

leetcode:238. Product of Array Except Self(Java)解答

转载请注明出处:z_zhaojun的博客 原文地址 题目地址 Product of Array Except SelfGiven an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of...
阅读(1288) 评论(0)

ThreadLocal详解

ThreadLocal是什么 早在JDK 1.2的版本中就提供java.lang.ThreadLocal,ThreadLocal为解决多线程程序的并发问题提供了一种新的思路。使用这个工具类可以很简洁地编写出优美的多线程程序。 ThreadLocal很容易让人望文生义,想当然地认为是一...
阅读(789) 评论(1)

leetcode:283. Move Zeroes(Java)解答

转载请注明出处:z_zhaojun的博客 原文地址:http://blog.csdn.net/u012975705 题目地址:https://leetcode.com/problems/move-zeroes/ Move Zeroes Given an array nums, write a function to move all 0's to the end of it while...
阅读(1495) 评论(1)

leetcode:119. Pascal's Triangle II(Java)解答

转载请注明出处:z_zhaojun的博客 原文地址:http://blog.csdn.net/u012975705/ 题目地址:https://leetcode.com/problems/pascals-triangle-ii/ Pascal’s Triangle II Given an index k, return the kth row of the Pascal's tri...
阅读(1481) 评论(0)

leetcode:142. Linked List Cycle II(Java)解答

转载请注明出处:z_zhaojun的博客 原文地址:http://blog.csdn.net/u012975705 题目地址:https://leetcode.com/problems/linked-list-cycle-ii/ Linked List Cycle II Given a linked list, return the node where the cycle be...
阅读(1953) 评论(1)

leetcode:82. Remove Duplicates from Sorted List II(Java)解答

转载请注明出处:z_zhaojun的博客 原文地址:http://blog.csdn.net/u012975705 题目地址:https://leetcode.com/problems/reverse-linked-list-ii/ Remove Duplicates from Sorted List II Given a sorted linked list, delete all...
阅读(1249) 评论(1)

leetcode:92. Reverse Linked List II(Java)解答

转载请注明出处:z_zhaojun的博客 原文地址:http://blog.csdn.net/u012975705 题目地址:https://leetcode.com/problems/reverse-linked-list-ii/Reverse Linked List IIReverse a linked list from position m to n. Do it in-place an...
阅读(1672) 评论(0)

解决在onCreate()过程中获取View的width和Height为0的4种方法

1、监听Draw/Layout事件:ViewTreeObserver ViewTreeObserver监听很多不同的界面绘制事件。一般来说OnGlobalLayoutListener就是可以让我们获得到view的width和height的地方.下面onGlobalLayout内的代码会在View完成La...
阅读(1107) 评论(1)

Android 操作系统的内存回收机制

Android APP 的运行环境      Android 是一款基于 Linux 内核,面向移动终端的操作系统。为适应其作为移动平台操作系统的特殊需要,谷歌对其做了特别的设计与优化,使得其进程调度与资源管理与其他平台的 Linux 有明显的区别。主要包含下面几个层次:Application Framework      Application Framework 将整个操作系统分隔成两个部分。对...
阅读(1952) 评论(1)
73条 共5页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:148775次
    • 积分:2156
    • 等级:
    • 排名:第18389名
    • 原创:44篇
    • 转载:29篇
    • 译文:0篇
    • 评论:52条
    博客专栏
    友情链接
    最新评论