2015年07月_编码886

12月 08月 07月 06月

转载 leetcode难度及面试频率

转载：http://blog.csdn.net/yutianzuijin/article/details/11477603 1Two Sum25arraysort s

2015-07-17 21:43:24 729

原创 android 收集已发布版本的错误信息（UncaughtExceptionHandler）

前言：在开发安卓的过程中，debug绝对是任何开发人员极为痛绝的事情。在本地开发过程中，如果出现错误，还可以查看logcat信息，但是市场上的手机五花八门，各种型号各种屏幕尺寸，甚至各种各样的用户，开发者难以确定什么时候用户会出现bug.那么搜集已经发布的版本bug信息，对于版本更新和用户体验是十分重要的事情，那么如何实现？在项目中用到这种需求，花了半天时间研究了一下，具体用法待我一一道来。

2015-07-31 09:44:14 865

原创 android 百度地图API 使用Marker和InfoWindow

前言：在android开发过程中，百度地图的使用是比较普遍的，但是如何使用，使用什么版本的百度API还是需要一些讲究。在项目过程中，需要用到百度地图的marker和InfoWindow的功能。标注覆盖物（百度地图官方图）布局文件很简单，主要就是mapview,如下：<LinearLayout xmlns:android="http://schemas.android.

2015-07-31 09:36:10 4214

转载 2015阿里巴巴实习生招聘客户端开发试题

2015-04-03，阿里巴巴暑期实习生招聘，第一轮，笔试，客户端开发，在线测试，为了可以给以后来的同学们一点经验，特意把题目留下来了，希望可以给大家帮助。技术类的题基本都一样，大概是有一个题库，虽然每个人的题目不一样，但是还是会有一些重合率。测试环节40分钟，20道选择题80分钟，3道简答题以下答案都是我蒙的，不要参考选择题

2015-07-30 22:16:26 595

原创 leetCode 102.Binary Tree Level Order Traversal (二叉树水平遍历) 解题思路和方法

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20

2015-07-30 17:03:06 807

原创 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 is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f

2015-07-30 17:01:17 701

原创 leetCode 100.Same Tree (同树判断) 解题思路和方法

Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.思路：判断两棵树是否相同

2015-07-30 16:56:56 802

原创 leetCode 99.Recover Binary Search Tree(修正二叉搜索树) 解题思路和方法

Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is pretty straight forward. Could you devis

2015-07-30 16:54:31 722

原创 leetCode 98.Validate Binary Search Tree (有效二叉搜索树) 解题思路和方法

Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th

2015-07-30 16:49:08 691

转载 android Studio 常用快捷键大全

接下来这篇android studio使用教程，主要为大家介绍的是android studio快捷键，如果我们掌握了一些常用快捷键，那么在使用android studio的过程中会达到事半功倍的效果哦~　　----常用快捷键　　1.Ctrl+E，可以显示最近编辑的文件列表　　2.Shift+Click可以关闭文件　　3.Ctrl+[或]可以跳到大括号的开头结

2015-07-28 15:45:19 483

原创 leetCode 97.Interleaving String (交错字符串) 解题思路和方法

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", ret

2015-07-28 11:02:50 2291

原创 leetCode 96.Unique Binary Search Trees (唯一二叉搜索树) 解题思路和方法

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1 3

2015-07-28 10:50:55 543

原创 leetCode 94.Binary Tree Inorder Traversal（二叉树中序遍历）解题思路和方法

Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio

2015-07-28 09:32:19 1099

原创 leetCode 95.Unique Binary Search Trees II （唯一二叉搜索树）解题思路和方法

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1 3

2015-07-28 09:31:56 998

原创斐波那契高效算法（4种算法综合分析）

斐波那契数列问题是算法学习者必然接触到的问题，作为经典问题，首次接触时一般是作为递归算法的案例教程。然而递归解决斐波那契，其效率低的令人发指，有人算出其时间复杂度为O(2^n)。指数级时间复杂度。如果面试的时候面试官问你斐波那契的求解方法，你来一个递归求解，基本上可以说，你已经game over了。那么有没有更高效的算法呢，本文将一一介绍。下面是斐波那契的4种解法：1.递归

2015-07-27 17:34:41 21320 7

原创 leetCode 93.Restore IP Addresses (恢复IP地址) 解题思路和方法

Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order

2015-07-27 09:52:23 5707 1

原创 leetCode 92.Reverse Linked List II (反转链表II) 解题思路和方法

Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m, n satisfy t

2015-07-27 09:50:30 1702

原创 leetCode 91.Decode Ways (解码方式) 解题思路和方法

A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total nu

2015-07-27 09:49:37 4291 3

原创 android 自定义dialog并实现失去焦点（背景透明）的功能

前言：由于在项目中需要用到更新显示动画的需求，所以想到了dialog，自定义dialog不难，网上教程很多，但是在实现dialog背景透明的需求时，遇到了一点问题，网上的一些方法在我的机器上并没有实现，只能曲折中找到了另一个方法实现。虽然有点麻烦，但毕竟效果不错。此方法写在这里，一是和各位分享，二是做个记录，留待以后需求。不说了，上代码：下面是dialog自定义布局文件，是执行

2015-07-27 09:48:59 3470

原创 leetCode 90.Subsets II（子集II）解题思路和方法

Given a collection of integers that might contain duplicates, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain du

2015-07-25 09:54:00 2014

原创 leetCode 89.Gray Code （格雷码）解题思路和方法

The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of

2015-07-25 09:48:24 1037

原创 leetCode 88.Merge Sorted Array （合并排序数组）解题思路和方法

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold add

2015-07-25 09:45:45 1839

原创 leetCode 87.Scramble String （拼凑字符串）解题思路和方法

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great": great / \ gr

2015-07-25 09:41:22 1400

原创 leetCode 86.Partition List(分区链表) 解题思路和方法

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of

2015-07-25 09:36:37 1624

原创 leetCode 85.Maximal Rectangle （最大矩阵）解题思路和方法

Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.思路：此题的意思是给一个为0或1的矩阵，求全部为1组成的最大矩阵的面积。此题可以巧妙转化为求最大直方图面积的问题。public class S

2015-07-22 13:43:51 2649

原创 leetCode 84.Largest Rectangle in Histogram （最大矩形直方图）解题思路和方法

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width o

2015-07-22 13:36:21 1031

原创 leetCode 83.Remove Duplicates from Sorted List（删除排序链表的重复）解题思路和方法

Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.思路：此题与上一题异曲同工，具体解法如下：

2015-07-22 13:33:28 682

原创 leetCode 82.Remove Duplicates from Sorted List II （删除排序链表的重复II）解题思路和方法

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1->2->3->3->4->4->5, return 1->2->5.Given 1->1-

2015-07-22 13:29:46 991

原创 leetCode 81.Search in Rotated Sorted Array II （旋转数组的搜索II）解题思路和方法

Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the

2015-07-22 13:26:56 518

原创 leetCode 80.Remove Duplicates from Sorted Array II (删除排序数组中的重复II) 解题思路和方法

Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first fi

2015-07-22 13:25:06 978

原创 leetCode 79.Word Search （词搜索）解题思路和方法

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

2015-07-22 13:21:15 1084

原创 leetCode 78.Subsets (子集) 解题思路和方法

Given a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For

2015-07-22 13:18:53 952

原创 leetCode 77.Combinations (组合)

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]

2015-07-22 13:15:00 1138

转载 android studio gradle download 无反应

在使用android studio 新建项目的时候，会发现一直无法下载 gradle-0.8.3.jar(也有可能是其他版本)，如下：Gradle: Download: http://repo1.maven.org/maven2/com/android/tools/build/gradle/0.8.3/gradle-0.8.3.jar程序一直卡住不动，但是你可直接打开这个地址看一下这个文

2015-07-21 18:54:29 1829

原创 leetCode 76.Minimum Window Substring(最小窗口子串) 解题思路和方法

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BAN

2015-07-19 16:43:06 2047 1

原创 leetCode 75.Sort Colors (颜色排序) 解题思路和方法

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers

2015-07-19 16:38:00 2181

原创 leetCode 74.Search a 2D Matrix(搜索二维矩阵) 解题思路和方法

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each

2015-07-19 16:35:54 1253

原创 leetCode 73.Set Matrix Zeroes (矩阵置0) 解题思路和方法

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A straight forward solution using O(m

2015-07-17 22:33:25 1238

原创 leetCode 72.Edit Distance (编辑距离) 解题思路和方法

Edit DistanceGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 op

2015-07-17 16:58:01 2200

原创 leetCode 71.Simplify Path（化简路径）解题思路和方法

Simplify PathGiven an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cas

2015-07-17 16:45:57 1506

C语言完美知识点总结-考试必备

2023-11-29

C语言期末复习知识点总结

2023-11-29

惠普打印机驱动-2520

2023-11-29

hellocharts-library-1.5.8.jar

详细使用方法请移步博客http://blog.csdn.net/xygy8860/article/details/50394194

2015-12-24

百度地图的SDK(libBaiduMapSDK_v3_0_0)

博客地址：http://blog.csdn.net/xygy8860，有关于这个sdk使用的介绍

2015-07-30

libBaiduMapSDK_v3_0_0

开发者可利用SDK提供的接口，使用百度为您提供的基础地图数据。目前百度地图SDK所提供的地图等级为3-19级，所包含的信息有建筑物、道路、河流、学校、公园等内容。所有叠加或覆盖到地图的内容，我们统称为地图覆盖物。如标注、矢量图形元素（包括：折线、多边形和圆等）、定位图标等。覆盖物拥有自己的地理坐标，当您拖动或缩放地图时，它们会相应的移动。

2015-07-30

js学习-数码时钟-动态显示当前时间

运用JavaScript实现的数码时钟效果，动态显示当前时间，可以运用在网站开发中，也是学习JavaScript的一些技巧的参考。

2015-06-17

js特效-无缝滚动

学习js运动的一种运动特效，无缝滚动，在网页开发中运用广泛，是建设网站必备的一种运动特效。

2015-06-17

在线音乐网站

使用java和jsp开发一款在线音乐网站，实现播放和上传功能，包含后台管理页面和评论页面。是一款很好的入门参考资料。

2015-06-17

空空如也

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

TA关注的人