06 2014 档案

摘要:方法:1. 基本的main方法:public static void main(String[] args)2.静态方法内部调用非静态方法:重新声明一个类,通过这个类来调用非静态方法 1 public class MAINMETHOD { 2 public static void main(... 阅读全文
posted @ 2014-06-30 11:33 SunshineAtNoon 阅读(176) 评论(0) 推荐(0) 编辑
摘要:觉得自己记忆力很烂的样子,读书不做笔记就好像没读一样,所以决定以后读技术类的书籍,都要做好笔记。1.IP地址和域名:如果把IP地址类比成身份证号的话,域名就是持证人的名字。2.端口:规定一个 设备有216个,也就是65536个端口,每个端口对应一个唯一的程序。 0~1024之间多被操作系统占... 阅读全文
posted @ 2014-06-29 13:46 SunshineAtNoon 阅读(259) 评论(0) 推荐(0) 编辑
摘要:Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文
posted @ 2014-06-19 22:11 SunshineAtNoon 阅读(148) 评论(0) 推荐(0) 编辑
摘要:Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo... 阅读全文
posted @ 2014-06-19 21:50 SunshineAtNoon 阅读(152) 评论(0) 推荐(0) 编辑
摘要:A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文
posted @ 2014-06-19 21:34 SunshineAtNoon 阅读(183) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].题解... 阅读全文
posted @ 2014-06-11 10:18 SunshineAtNoon 阅读(143) 评论(0) 推荐(0) 编辑
摘要:Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文
posted @ 2014-06-10 20:01 SunshineAtNoon 阅读(307) 评论(0) 推荐(0) 编辑
摘要:Given an array withnobjects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, wh... 阅读全文
posted @ 2014-06-10 17:18 SunshineAtNoon 阅读(311) 评论(0) 推荐(0) 编辑
摘要:GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]... 阅读全文
posted @ 2014-06-10 16:24 SunshineAtNoon 阅读(151) 评论(0) 推荐(0) 编辑
摘要:The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number... 阅读全文
posted @ 2014-06-10 11:22 SunshineAtNoon 阅读(166) 评论(0) 推荐(0) 编辑
摘要:Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal... 阅读全文
posted @ 2014-06-10 10:53 SunshineAtNoon 阅读(159) 评论(0) 推荐(0) 编辑
摘要: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 / \ ... 阅读全文
posted @ 2014-06-09 23:40 SunshineAtNoon 阅读(149) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth... 阅读全文
posted @ 2014-06-09 21:00 SunshineAtNoon 阅读(173) 评论(0) 推荐(0) 编辑
摘要:You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2014-06-09 20:58 SunshineAtNoon 阅读(182) 评论(0) 推荐(0) 编辑
摘要:Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.水题不解释,一A,... 阅读全文
posted @ 2014-06-09 20:39 SunshineAtNoon 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't mat... 阅读全文
posted @ 2014-06-09 20:30 SunshineAtNoon 阅读(186) 评论(0) 推荐(0) 编辑
摘要:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,... 阅读全文
posted @ 2014-06-09 19:41 SunshineAtNoon 阅读(133) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示