- 博客(13)
- 收藏
- 关注
原创 关于“java内存模型”的误区
你没看错,这篇文章总共就想说这么几句话:程序员面试中面试官经常提到的“java内存模型”这个字眼,大多是想让你谈论JMM。而不是想让你谈论“线程栈、堆、静态方法区”这个维度。好了,祝你面试顺利...
2018-03-27 16:23:32 153
原创 leetCode Min Stack解题分享
原题:https://oj.leetcode.com/problems/min-stack/Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- R
2014-11-10 12:52:22 1594
原创 leetCode Triangle 解题分享
原题:https://oj.leetcode.com/problems/triangle/Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given th
2014-09-18 22:33:04 545
原创 leetCode Distinct Subsequences 解题分享
原题:https://oj.leetcode.com/problems/distinct-subsequences/Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which
2014-09-18 19:53:46 829 1
原创 leetCode Recover Binary Search Tree解题分享
原题:https://oj.leetcode.com/problems/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 so
2014-09-18 00:03:13 476
原创 leetCode 3Sum 解题分享
原题:https://oj.leetcode.com/problems/3sum/Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of z
2014-09-09 18:22:02 531
原创 Populating Next Right Pointers in Each Node II解题分享
原题:https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/本文解题过程
2014-08-20 14:31:30 879
原创 leetCode Best Time to Buy and Sell Stock II解题分享
原题:https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/今天临,女朋友崔,
2014-08-03 21:37:06 408
原创 leetCode single number解题分享
原题:https://oj.leetcode.com/problems/single-number/
2014-08-03 16:45:39 488
原创 leetCode Word Break解题分享
原题链接:https://oj.leetcode.com/problems/word-break/
2014-07-31 21:12:50 590
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人