腾讯云开发者社区-腾讯云

开发者社区

文档建议反馈控制台

最新优惠活动

文章/答案/技术大牛

发布

LeetCode

专栏作者

143

文章

98688

阅读量

31

订阅数

Java Hotspot G1 GC的一些关键技术

G1 GC，全称Garbage-First Garbage Collector，通过-XX:+UseG1GC参数来启用，作为体验版随着JDK 6u14版本面世，在JDK 7u4版本发行时被正式推出，相信熟悉JVM的同学们都不会对它感到陌生。在JDK 9中，G1被提议设置为默认垃圾收集器（JEP 248）。在官网中，是这样描述G1的：

大学里的混子

2018-11-29

1.3K0

LeetCode <BT> 200. Number of Islands

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

大学里的混子

2018-11-23

4130

LeetCode <Stack>84&85. Maximal Rectangle&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.

大学里的混子

2018-11-20

4010

LeetCode <heap>373. Find K Pairs with Smallest Sums

You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.

大学里的混子

2018-11-15

5540

LeetCode <dp>120&931 Triangle&Minimum Falling Path Sum

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

大学里的混子

2018-11-15

3510

LeetCode <dfs>173.Binary Search Tree Iterator

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

大学里的混子

2018-11-13

4120

LeetCode <dp>53&121&122. Maximum Subarray & Best Time to Buy and Sell Stock

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

大学里的混子

2018-11-13

5910

LeetCode <dfs>108&109. Array & List to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

大学里的混子

2018-11-13

3470

LeetCode <dp>152&628 Maximum Product Subarray

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.

大学里的混子

2018-11-13

4820

LeetCode <dp>62&63.Unique Paths I&II

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

大学里的混子

2018-11-13

3750

LeetCode <dfs>105&106 Construct Binary Tree

Given preorder and inorder traversal of a tree, construct the binary tree.

大学里的混子

2018-11-12

4810

IDEA 的快捷按键

常用的有fori/sout/psvm+Tab即可生成循环、System.out、main方法等boilerplate样板代码

大学里的混子

2018-11-06

8680

LeetCode 191. Number of 1 Bits

Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight).

大学里的混子

2018-11-05

2810

LeetCode <dp>64. Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

大学里的混子

2018-11-05

6630

LeetCode 54 &59 Spiral MatrixI&II

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

大学里的混子

2018-11-04

5850

LeetCode 297.Serialize And Deserialize Binary Tree

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

大学里的混子

2018-11-03

3960

LeetCode 2 & 455 Add Two Numbers I&II

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

大学里的混子

2018-11-03

3940

LeetCode 112&113&437 Path Sum I&II&III

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

大学里的混子

2018-11-02

3860

简单算法杂例

第一：如果B栈为空，那么将A中的所有元素依次弹出后放入B栈中（负负为正，FILO顺序颠倒，再颠倒依次就为原始的顺序），此时B栈中已经有了元素，弹出的方式见“第二”

大学里的混子

2018-11-02

4140

BST & AVL 二分搜索树 & 平衡二叉树的实现原理

本文完整的实现了基本的BST，由于注重的是逻辑和原理的实现，所以没有采用泛型。注意方法的访问修饰符。

大学里的混子

2018-11-01

6570

点击加载更多

社区活动

腾讯技术创作狂欢月

“码”上创作 21 天，分 10000 元奖品池！

Python精品学习库

代码在线跑，知识轻松学

博客搬家 | 分享价值百万资源包

自行/邀约他人一键搬运博客，速成社区影响力并领取好礼

技术创作特训营·精选知识专栏

往期视频·千货材料·成员作品最新动态