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

开发者社区

文档建议反馈控制台

最新优惠活动

文章/答案/技术大牛

发布

眯眯眼猫头鹰的小树杈

专栏作者

152

文章

88348

阅读量

25

订阅数

从零开始JVM(一)：初探JVM运行时数据区域

jvm 打包编程算法 java

最近重新开始阅读《深入了解Java虚拟机》这本书，就想着用一个系列文章来记录和分享自己的心得。为什么要说”重新“呢？是因为这本书我在多年前就买了，中间也曾翻来覆去的看过。这个”翻来覆去“可以说是非常的生动形象，因为我不仅从前往后看，也从后往前看了这本书。但是，这并不是一个值得骄傲的过程，因为我之前看的时候经常被卡住（俗称看不懂），导致我中途放弃。再次拾起的时候为了多一些新鲜感，就尝试从后往前看，事实证明效果依旧不佳。今年我又拿起这本书（生活所迫），这次阅读下来，相比之前要流畅许多，可能是因为有了一些工作经验吧（社会的毒打）。感觉这本书难以坚持阅读主要有几个几个原因：

眯眯眼的猫头鹰

2022-03-23

1780

记一次PageHelper分页未生效问题排查

sql 网络安全 mybatis 数据分析编程算法

最近在项目中使用PageHelper分页工具+Mybatis实现分页查询逻辑，但是发现分页逻辑并没有生效，代码片段如下：

眯眯眼的猫头鹰

2022-03-23

1.3K0

每个开发必须了解的Unicode和字符集的那些事！

unicode 编程算法 ascii 存储 html

你曾经对神秘的Content-Type标签感到好奇吗？就是那个在HTML中经常用到但是很少有人了解为什么要去使用它的标签。

眯眯眼的猫头鹰

2021-04-01

1.4K0

leetcode540. Single Element in a Sorted Array

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Find this single element that appears only once.

眯眯眼的猫头鹰

2020-05-12

3470

leetcode535. Encode and Decode TinyURL

php 编程算法 http

TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http://tinyurl.com/4e9iAk.

眯眯眼的猫头鹰

2020-05-12

3710

leetcode543. Diameter of Binary Tree

编程算法 node.js

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

眯眯眼的猫头鹰

2020-05-12

3150

leetcode460. LFU Cache

linux http sql 缓存编程算法

Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: get and put.

眯眯眼的猫头鹰

2020-05-12

3870

leetcode480. Sliding Window Median

编程算法数据结构

Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.

眯眯眼的猫头鹰

2020-05-11

3730

leetcode516. Longest Palindromic Subsequence

Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.

眯眯眼的猫头鹰

2020-05-11

4180

leetcode519. Random Flip Matrix

编程算法存储

You are given the number of rows n_rows and number of columns n_cols of a 2D binary matrix where all values are initially 0. Write a function flip which chooses a 0 value uniformly at random, changes it to 1, and then returns the position [row.id, col.id] of that value. Also, write a function reset which sets all values back to 0. Try to minimize the number of calls to system's Math.random() and optimize the time and space complexity.

眯眯眼的猫头鹰

2020-05-11

4590

leetcode503. Next Greater Element II

Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn't exist, output -1 for this number.

眯眯眼的猫头鹰

2020-05-11

4500

leetcode523. Continuous Subarray Sum

Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to a multiple of k, that is, sums up to n*k where n is also an integer.

眯眯眼的猫头鹰

2020-05-11

4190

leetcode556. Next Greater Element III

Given a positive 32-bit integer n, you need to find the smallest 32-bit integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive 32-bit integer exists, you need to return -1.

眯眯眼的猫头鹰

2020-05-11

4710

leetcode502. IPO

tcp/ip 编程算法

Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the IPO. Since it has limited resources, it can only finish at most k distinct projects before the IPO. Help LeetCode design the best way to maximize its total capital after finishing at most k distinct projects.

眯眯眼的猫头鹰

2020-05-11

4210

leetcode525. Contiguous Array

Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.

眯眯眼的猫头鹰

2020-05-11

3530

547. Friend Circles

There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, then A is an indirect friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.

眯眯眼的猫头鹰

2020-05-11

3880

leetcode554. Brick Wall

linux 编程算法

There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. You want to draw a vertical line from the top to the bottom and cross the least bricks.

眯眯眼的猫头鹰

2020-05-11

4450

leetcode542. 01 Matrix

Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.

眯眯眼的猫头鹰

2020-05-11

3320

513. Find Bottom Left Tree Value

Given a binary tree, find the leftmost value in the last row of the tree.

眯眯眼的猫头鹰

2019-11-19

4120

leetcode508. Most Frequent Subtree Sum

node.js 编程算法

题目要求 Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself). So what is the most frequent s

眯眯眼的猫头鹰

2019-11-15

3480

点击加载更多

社区活动

腾讯技术创作狂欢月

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

Python精品学习库

代码在线跑，知识轻松学

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

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

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

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