Java
ov大鱼vo
我们的远方是星辰大海
展开
-
常用JVM配置参数
-XX:+PrintGCDetails a) 打印GC详细信息 -XX:+PrintGCTimeStamps a) 打印CG发生的时间戳 -Xloggc:log/gc.log a) 指定GC log的位置,以文件输出 b) 帮助开发人员分析问题 -XX:+TraceClassLoading a) 监控类的加载 -XX:+Print...转载 2018-04-28 16:45:40 · 204 阅读 · 0 评论 -
LeetCode 260. Single Number III
分析难度 中来源 https://leetcode.com/problems/single-number-iii/两种方式,位运算或者利用HashSethttps://leetcode.com/problems/single-number-iii/discuss/68901/Sharing-explanation-of-the-solutionThe two numbers that ...原创 2019-02-20 17:15:45 · 187 阅读 · 0 评论 -
LeetCode139. Word Break
分析难度 中来源 https://leetcode.com/problems/word-break/思路题目Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separ...原创 2019-02-26 13:32:01 · 167 阅读 · 0 评论 -
LeetCode 306. Additive Number
分析难度 中来源 https://leetcode.com/problems/additive-number/题目Additive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Excep...原创 2019-03-05 16:35:25 · 210 阅读 · 0 评论 -
LeetCode 300. Longest Increasing Subsequence
分析难度 中来源 https://leetcode.com/problems/longest-increasing-subsequence/思路tails is an array storing the smallest tail of all increasing subsequences with length i+1 in tails[i].For example, say we ...原创 2019-03-02 18:05:49 · 353 阅读 · 0 评论 -
LeetCode 274. H-Index
分析难度 中来源 https://leetcode.com/problems/h-index/思路1If we have the function f ordered in decreasing order from the largest value to the lowest one, we can compute the h index as follows:思路2 //The...原创 2019-02-21 11:00:19 · 194 阅读 · 0 评论 -
LeetCode 304. Range Sum Query 2D - Immutable
分析难度 中来源 https://leetcode.com/problems/range-sum-query-2d-immutable/题目Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and ...原创 2019-03-04 09:34:32 · 187 阅读 · 0 评论 -
LeetCode 307. Range Sum Query - Mutable
分析难度 中来源 https://leetcode.com/problems/range-sum-query-mutable/思路 https://blog.csdn.net/Jasmineaha/article/details/81462020使用树状数组(Binary Indexed Tree)其中A为普通数组,C为树状数组,奇数下标一定是叶子结点。相比线段树,所用空间更小,速度...原创 2019-03-07 16:55:35 · 166 阅读 · 0 评论 -
LeetCode 309. Best Time to Buy and Sell Stock with Cooldown
分析难度 中来源 https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/题目Say you have an array for which the i th element is the price of a given stock on day i.Design an algorithm ...原创 2019-03-08 10:15:55 · 231 阅读 · 0 评论 -
LeetCode 2. Add Two Numbers
分析难度 中来源 https://leetcode.com/problems/add-two-numbers/题目You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their n...原创 2019-03-31 15:13:36 · 128 阅读 · 0 评论 -
LeetCode 64. Minimum Path Sum
分析难度 中来源 https://leetcode.com/problems/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 alon...原创 2019-03-28 21:33:42 · 254 阅读 · 0 评论 -
LeetCode 143. Reorder List
分析难度 中来源 https://leetcode.com/problems/reorder-list/思路Find the middle of the listReverse the half after middleStart reorder one by one题目Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder...原创 2019-03-01 11:10:51 · 177 阅读 · 0 评论 -
LeetCode 138. Copy List with Random Pointer
分析难度 中来源 https://leetcode.com/problems/copy-list-with-random-pointer/思路Iterate the original list and duplicate each node. The duplicateof each node follows its original immediately.Iterate the ...原创 2019-02-25 15:26:07 · 204 阅读 · 0 评论 -
JVM运行机制
Java没有寄存器,所有参数传递使用操作数栈Java栈 – 栈上分配小对象(一般几十个bytes),在没有逃逸的情况下,可以直接分配在栈上直接分配在栈上,可以自动回收,减轻GC压力大对象或者逃逸对象无法栈上分配可见性一个线程修改了变量,其他线程可以立即知道保证可见性的方法volatilesynchronized (unlock之前,写变量值回主存)final(一旦初始化完成,其他线程就可见)转载 2018-04-28 16:52:51 · 145 阅读 · 0 评论 -
LeetCode 275. H-Index II
分析难度 中来源 https://leetcode.com/problems/h-index-ii/题目Given an array of citations sorted in ascending order (each citation is a non-negative integer) of a researcher, write a function to compute the...原创 2019-02-22 09:58:05 · 177 阅读 · 0 评论 -
LeetCode 289. Game of Life
分析难度 中来源 https://leetcode.com/problems/game-of-life/思路To solve it in place, we use 2 bits to store 2 states: [2nd bit, 1stbit] = [next state, current state]00 dead (next) <- dead (current)...原创 2019-02-23 15:39:32 · 178 阅读 · 0 评论 -
LeetCode 313. Super Ugly Number
分析难度 中来源 https://leetcode.com/problems/super-ugly-number/题目Write a program to find the nth super ugly number.Super ugly numbers are positive numbers whose all prime factors are in the given prime...原创 2019-02-18 20:46:10 · 133 阅读 · 0 评论 -
LeetCode 299. Bulls and Cows
分析难度 中来源 https://leetcode.com/problems/bulls-and-cows/题目You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is....原创 2019-02-24 11:15:32 · 209 阅读 · 0 评论 -
LeetCode 355. Design Twitter
分析难度 中来源 https://leetcode.com/problems/design-twitter/题目Design a simplified version of Twitter where users can post tweets, follow/unfollow another user and is able to see the 10 most recent tweet...原创 2019-02-19 20:08:24 · 305 阅读 · 0 评论 -
LeetCode 144. Binary Tree Preorder Traversal
分析难度 中来源 https://leetcode.com/problems/binary-tree-preorder-traversal/submissions/题目Given a binary tree, return the preorder traversal of its nodes’ values.Example:Input: [1,null,2,3]1 ...原创 2019-03-01 08:52:12 · 112 阅读 · 0 评论 -
构造二叉树
public TreeNode buildTree(Integer[] array){ TreeNode root=new TreeNode(array[0]);//假设array[0]不为null Queue&lt;TreeNode&gt; queue=new LinkedList&lt;TreeNode&gt;(); queue.offer(r...原创 2019-03-01 08:54:32 · 1159 阅读 · 0 评论 -
打印二叉树
TreeNode实现同LeetCode:public class TreeNode { Integer val; TreeNode left; TreeNode right; //TreeNode(Integer x) { val = x; } TreeNode(int x) { val = x; left=null; ...原创 2019-03-01 08:57:55 · 1327 阅读 · 0 评论 -
LeetCode 150. Evaluate Reverse Polish Notation
分析难度 中来源 https://leetcode.com/problems/evaluate-reverse-polish-notation/使用集合存储操作符,使用栈存储操作数,当下一个字符串为数字时,压栈;当下一个字符串记录操作符的时候,连续两次退栈,结合操作符计算结果,然后压栈题目Evaluate the value of an arithmetic expression in ...原创 2019-03-01 09:46:41 · 140 阅读 · 0 评论 -
LeetCode 310. Minimum Height Trees
分析难度 中来源 https://leetcode.com/problems/minimum-height-trees/题目For an undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among a...原创 2019-03-28 22:24:31 · 148 阅读 · 0 评论