Tags

keep hungry keep foolish
Ubuntu

Ubuntu系统下安装和配置JDK

如何在Ubuntu下，根据自己的需要来安装和配置JDK

Java

Ubuntu系统下安装和配置JDK

如何在Ubuntu下，根据自己的需要来安装和配置JDK

Android

ADB实用命令大全

ADB实用命令大全

安卓应用角标那些事儿

聊一聊安卓应用角标适配那些事儿

《Android开发艺术探索》读书笔记 - View的工作原理

探一探View的工作原理

基于Chipsee资料编译Android系统

基于Chipsee提供的相关资料编译出Android 4.0.3文件系统，并移植到Pandaboard ES开发板上运行

算法

LeetCode | Single Number II

Given an array of integers, every element appears three times except for one. Find that single one.

LeetCode | Single Number

Given an array of integers, every element appears twice except for one. Find that single one.

LeetCode | 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.

LeetCode | 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.

LeetCode | 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.

LeetCode | Linked List Cycle

判断一个单链表是否有环，若有环的话，返回环的入口点。空间复杂度为O(1)

LeetCode | 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.

LeetCode | Binary Tree Traversal

分别使用递归、非递归方法，实现二叉树的先序、中序和后序遍历。

LeetCode | LRU Cache

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.

LeetCode

LeetCode | Single Number II

Given an array of integers, every element appears three times except for one. Find that single one.

LeetCode | Single Number

Given an array of integers, every element appears twice except for one. Find that single one.

LeetCode | 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.

LeetCode | 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.

LeetCode | 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.

LeetCode | Linked List Cycle

判断一个单链表是否有环，若有环的话，返回环的入口点。空间复杂度为O(1)

LeetCode | 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.

LeetCode | Binary Tree Traversal

分别使用递归、非递归方法，实现二叉树的先序、中序和后序遍历。

LeetCode | LRU Cache

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.

生活

2017，新博客，心启航！

欢迎来到wzystal的新博客！

读书笔记

《Android开发艺术探索》读书笔记 - View的工作原理

探一探View的工作原理