摘要: 1.1概述 Java与C++有一堵由内存分配和垃圾回收技术所构成的“高墙” 1.2 运行时数据区域 1.2.1 程序计数器 程序计数器是一小块的内存空间,它可以看作是当前线程执行字节码的行号指示器。通过改变这个计数器可以去选取下一条指令 在任何一个确定的时刻,一个处理器都只会执行一条线程中的指令。每 阅读全文
posted @ 2018-10-10 22:38 C`Moriarty 阅读(211) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected e 阅读全文
posted @ 2018-10-10 22:34 C`Moriarty 阅读(127) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n  阅读全文
posted @ 2018-10-10 22:32 C`Moriarty 阅读(94) 评论(0) 推荐(0) 编辑
摘要: Given a 32-bit signed integer, reverse digits of an integer. Example 1: Example 2: Example 3: Note:Assume we are dealing with an environment which cou 阅读全文
posted @ 2018-10-10 22:28 C`Moriarty 阅读(106) 评论(0) 推荐(0) 编辑
摘要: The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, calcul 阅读全文
posted @ 2018-10-10 22:26 C`Moriarty 阅读(107) 评论(0) 推荐(0) 编辑
摘要: Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order. E 阅读全文
posted @ 2018-10-09 22:35 C`Moriarty 阅读(86) 评论(0) 推荐(0) 编辑
摘要: Given an integer array, find three numbers whose product is maximum and output the maximum product. Example 1: Input: [1,2,3] Output: 6 Example 2: Inp 阅读全文
posted @ 2018-10-09 22:11 C`Moriarty 阅读(99) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longestpath betwee 阅读全文
posted @ 2018-10-08 22:28 C`Moriarty 阅读(99) 评论(0) 推荐(0) 编辑
摘要: Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence. For example, in the given t 阅读全文
posted @ 2018-10-08 22:03 C`Moriarty 阅读(97) 评论(0) 推荐(0) 编辑
摘要: Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The 阅读全文
posted @ 2018-10-07 20:14 C`Moriarty 阅读(94) 评论(0) 推荐(0) 编辑
/* 鼠标点击求赞文字特效 */ /*鼠标跟随效果*/