Java8内存模型—永久代(PermGen)和元空间(Metaspace)

转自https://ww 一、JVM 内存模型   根据 JVM 规范,JVM 内存共分为虚拟机栈、堆、方法区、程序计数器、本地方法栈五个部分。   1、虚拟机栈:每个线程有一个私有的栈,随着线程的创建而创建。栈里面存着的是一种叫“栈帧”的东西,每个方法会创建一个栈帧,栈帧中存放了局部变...

2019-03-23 16:18:09

阅读数 20

评论数 0

leetcode: 560. Subarray Sum Equals K DescriptionHintsSubmissionsDiscussSolution Given an array of in

560. Subarray Sum Equals K DescriptionHintsSubmissionsDiscussSolution Pick One Given an array of integers and an integer k, you need to find the t...

2018-10-12 00:05:36

阅读数 42

评论数 0

leetcode 147. Insertion Sort List

Sort a linked list using insertion sort. A graphical example of insertion sort. The partial sorted list (black) initially contains only the first e...

2018-10-10 00:01:54

阅读数 21

评论数 0

leetcode 103. Binary Tree Zigzag Level Order Traversal

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and...

2018-09-16 14:59:22

阅读数 27

评论数 0

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

2018-09-16 14:15:08

阅读数 30

评论数 0

leetcode: 316. Remove Duplicate Letters

Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure you...

2018-09-16 08:03:13

阅读数 36

评论数 0

leetcode 228. Summary Ranges

Given a sorted integer array without duplicates, return the summary of its ranges. Example 1: Input: [0,1,2,4,5,7] Output: ["0-&...

2018-09-10 19:26:09

阅读数 28

评论数 0

leetcode: 334. Increasing Triplet Subsequence

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true ...

2018-09-09 23:08:39

阅读数 26

评论数 0

hbase的行锁与多版本并发控制(MVCC)

http://san-yun.iteye.com/blog/2156663 参考:http://www.rigongyizu.com/hbase-row-lock-and-multiversion-concurrency-control/   MVCC (Multiversion Concu...

2018-09-08 17:11:49

阅读数 31

评论数 0

leetcode:Palindromic Substrings

Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes are...

2018-08-13 07:31:30

阅读数 33

评论数 0

leetcode 279. Perfect Squares

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. Example 1: Input: n = ...

2018-08-12 18:51:27

阅读数 37

评论数 0

leetcode: 115. Distinct Subsequences

Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string which is f...

2018-08-12 08:05:12

阅读数 38

评论数 0

leetcode:813. Largest Sum of Averages(DP)

We partition a row of numbers A into at most K adjacent (non-empty) groups, then our score is the sum of the average of each group. What is the large...

2018-08-11 14:58:37

阅读数 47

评论数 0

leetcode 129. Sum Root to Leaf Numbers

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1-&amp...

2018-08-08 00:18:48

阅读数 26

评论数 0

[leetcode] 116 Populating Next Right Pointers in Each Node

iven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point...

2018-08-07 23:49:39

阅读数 27

评论数 0

Java 并发 --- 非阻塞队列之ConcurrentLinkedQueue源码分析

转自:https://blog.csdn.net/u014634338/article/details/78825440在并发编程中,有时候需要使用线程安全的队列,如果要实现一个线程安全的队列有两种方式:一种是使用阻塞算法,另一种是使用非阻塞算法,在前面我们逐一分析过阻塞队列,这篇文章过后,会写篇...

2018-05-20 17:57:02

阅读数 140

评论数 0

Spark创建DataFrame的三种方法

转自:https://vimsky.com/article/2708.html跟关系数据库的表(Table)一样,DataFrame是Spark中对带模式(schema)行列数据的抽象。DateFrame广泛应用于使用SQL处理大数据的各种场景。创建DataFrame有很多种方法,比如从本地Lis...

2018-03-29 20:27:22

阅读数 5877

评论数 0

深夜学算法之SkipList:让链表飞

转自:https://www.jianshu.com/p/fcd18946994e1. 前言上次写Python操作LevelDB时提到过,有机会要实现下SkipList。摘录下wiki介绍:跳跃列表是一种随机化数据结构,基于并联的链表,其效率可比拟二叉查找树。我们知道对于有序链表,查找的时间复杂度...

2018-03-29 13:49:58

阅读数 82

评论数 0

判断是否正确的出栈顺序

bool isOK(int *arr, int len) { stack<int> auxStack; int i = 0; // the index for the arr int j = 1; // the number in seq 1,2...

2018-02-27 15:11:20

阅读数 122

评论数 0

堆排序

http://blog.csdn.net/zdp072/article/details/44227317 [算法说明] 堆排序是对简单选择排序的改进 简单选择排序是从n个记录中找出一个最小的记录,需要比较n-1次。但是这样的操作并没有把每一趟的比较结果保存下来,在后一...

2017-11-22 01:18:11

阅读数 120

评论数 0

提示
确定要删除当前文章?
取消 删除