码迷,mamicode.com
首页 >  
搜索关键字:permgen space    ( 18346个结果
AIX 中 Paging Space 使用率过高的分析与解决
AIX操作系统中Paging Space是很重要的设备,当系统中Paging Space使用率过高、系统内存不足时,将影响系统的整体性能,甚至会造成系统的挂起。针对这种情况,通常可以靠增加Paging Space来加以缓解;但是当Paging Space已经相当大,而Paging Space使用.....
分类:其他好文   时间:2014-12-12 10:11:26    阅读次数:181
LeetCode Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?首先指...
分类:其他好文   时间:2014-12-12 01:13:05    阅读次数:243
LeetCode Linked List Cycle
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?解题思路:突发奇想,脑洞大开。回路,自然是走到已经走过的地方,如何知道这个地方已经走...
分类:其他好文   时间:2014-12-11 23:48:27    阅读次数:147
leetcode------Linked List Cycle(3)
标题:Linked List Cycle通过率:36%难度中等Given a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?拿到题后我以为很简单...
分类:其他好文   时间:2014-12-11 17:09:01    阅读次数:167
【LeetCode】Length of Last Word
Length of Last WordGiven a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.I...
分类:其他好文   时间:2014-12-11 17:02:35    阅读次数:133
[LeetCode] Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not allocate extra space for a...
分类:其他好文   时间:2014-12-11 01:35:21    阅读次数:173
Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space?...
分类:其他好文   时间:2014-12-10 21:16:44    阅读次数:201
Oracle HotSpot虚拟机的JVM栈和方法区实现
Java Heap和Method Area是JVM中内存占用最大的区域,也是监控和调优的重点。 下图使用jvisualvm工具截取,Perm是永久代(Permanent Generation)、Old是年老代(Old Generation)、Eden Space 和S0+S1是年轻代(Y...
分类:数据库   时间:2014-12-10 18:19:13    阅读次数:254
【LeetCode】Linked List Cycle II
题目 Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space? 解答 利用快慢指针使用Linked List Cycle I的办法,判...
分类:其他好文   时间:2014-12-10 16:19:41    阅读次数:187
[LeetCode]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...
分类:其他好文   时间:2014-12-10 12:35:23    阅读次数:191
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!