_TCgogogo_
码龄8年
  • 1,166,302
    被访问
  • 1,077
    原创
  • 3,493
    排名
  • 587
    粉丝
  • 9
    铁粉
关注
提问 私信
IP属地以运营商信息为准,境内显示到省(区、市),境外显示到国家(地区)
IP 属地:江苏省
  • 加入CSDN时间: 2014-06-28
博客简介:

Tc的专栏

博客描述:
道阻且长 行则将至
查看详细资料
  • 4
    领奖
    总分 780 当月 7
个人成就
  • 获得243次点赞
  • 内容获得205次评论
  • 获得645次收藏
创作历程
  • 56篇
    2022年
  • 40篇
    2021年
  • 8篇
    2020年
  • 122篇
    2019年
  • 40篇
    2018年
  • 53篇
    2017年
  • 236篇
    2016年
  • 425篇
    2015年
  • 104篇
    2014年
成就勋章
TA的专栏
  • LeetCode
    330篇
  • dfs/bfs
    15篇
  • hash
    2篇
  • 算法题
    77篇
  • Java学习笔记
    11篇
  • 命令行小项目
    8篇
  • ----ACM----
  • ACM
    635篇
  • 数论
    78篇
  • 组合数学
    55篇
  • 概率期望
    19篇
  • 图论
    91篇
  • 数据结构
    128篇
  • 并查集
    20篇
  • 动态规划
    176篇
  • 贪心
    34篇
  • 搜索
    66篇
  • 二分/三分/两点法
    49篇
  • 模拟
    37篇
  • 字符串
    70篇
  • 博弈
    4篇
  • 计算几何
    22篇
  • 套路思维题
    68篇
  • codeforces
    53篇
  • 各类比赛
    54篇
  • ----ACM----|
  • 南邮课程实验
    23篇
  • ----LeetCode----
    1篇
  • Leetcode Easy
    48篇
  • Leetcode Medium
    242篇
  • Leetcode Hard
    59篇
  • ----LeetCode----|
  • 多线程
    4篇
  • Git
    2篇
  • Flume
    2篇
  • 计算机网络
    1篇
  • 数据库
    1篇
  • Java
    17篇
  • Shell脚本
    4篇
  • Android
    6篇
  • Python
    1篇
  • 机器学习
  • 朴素贝叶斯
  • 统计学习方法
  • 最近
  • 文章
  • 资源
  • 问答
  • 帖子
  • 视频
  • 课程
  • 关注/订阅/互动
  • 收藏
搜TA的内容
搜索 取消

LeetCode 1423 Maximum Points You Can Obtain from Cards (前缀和)

There are several cardsarranged in a row, and each card has an associated number of points. The points are given in the integer arraycardPoints.In one step, you can take one card from the beginning or from the end of the row. You have to take exactlyk...
原创
发布博客 2022.05.09 ·
142 阅读 ·
0 点赞 ·
0 评论

LeetCode 1383 Maximum Performance of a Team (优先队列 贪心 推荐)

You are given two integersnandkand two integer arraysspeedandefficiencyboth of lengthn. There arenengineers numbered from1ton.speed[i]andefficiency[i]represent the speed and efficiency of theithengineer respectively.Chooseat mostkd...
原创
发布博客 2022.05.08 ·
179 阅读 ·
0 点赞 ·
0 评论

LeetCode 1300 Sum of Mutated Array Closest to Target (前缀和 二分)

Given an integer arrayarrand a target valuetarget, return the integervaluesuch that when we change all the integers larger thanvaluein the given array to be equal tovalue, the sum of the array gets as close as possible (in absolute difference) tot...
原创
发布博客 2022.05.08 ·
126 阅读 ·
0 点赞 ·
0 评论

LeetCode 1721 Swapping Nodes in a Linked List (链表 快慢指针)

You are given theheadof a linked list, and an integerk.Returnthe head of the linked list afterswappingthe values of thekthnode from the beginning and thekthnode from the end (the list is1-indexed).Example 1:Input: head = [1,2,3,4,5], k ...
原创
发布博客 2022.05.07 ·
218 阅读 ·
0 点赞 ·
0 评论

LeetCode 994 Rotting Oranges (bfs 推荐)

You are given anm x ngridwhere each cell can have one of three values:0representing an empty cell, 1representing a fresh orange, or 2representing a rotten orange.Every minute, any fresh orange that is4-directionally adjacentto a rotten orange ...
原创
发布博客 2022.05.07 ·
91 阅读 ·
0 点赞 ·
0 评论

LeetCode 452 Minimum Number of Arrows to Burst Balloons (贪心,排序)

There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer arraypointswherepoints[i] = [xstart, xend]denotes a balloon whosehorizontal diameterstretches betweenxstartandxend....
原创
发布博客 2022.05.07 ·
85 阅读 ·
0 点赞 ·
0 评论

LeetCode 1035 Uncrossed Lines(dp 推荐)

You are given two integer arraysnums1andnums2. We write the integers ofnums1andnums2(in the order they are given) on two separate horizontal lines.We may draw connecting lines: a straight line connecting two numbersnums1[i]andnums2[j]such that...
原创
发布博客 2022.05.07 ·
40 阅读 ·
0 点赞 ·
0 评论

LeetCode 2131 Longest Palindrome by Concatenating Two Letter Words (hash)

You are given an array of stringswords. Each element ofwordsconsists oftwolowercase English letters.Create thelongest possible palindromeby selecting some elements fromwordsand concatenating them inany order. Each element can be selectedat mos...
原创
发布博客 2022.05.05 ·
131 阅读 ·
0 点赞 ·
0 评论

LeetCode 838 Push Dominoes (二点法,模拟)

There arendominoes in a line, and we place each domino vertically upright. In the beginning, we simultaneously push some of the dominoes either to the left or to the right.After each second, each domino that is falling to the left pushes the adjacent d..
原创
发布博客 2022.04.30 ·
211 阅读 ·
0 点赞 ·
0 评论

LeetCode 1590 Make Sum Divisible by P (前缀和 hash)

Given an array of positive integersnums, remove thesmallestsubarray (possiblyempty) such that thesumof the remaining elements is divisible byp. It isnotallowed to remove the whole array.Returnthe length of the smallest subarray that you need to...
原创
发布博客 2022.04.03 ·
438 阅读 ·
0 点赞 ·
0 评论

LeetCode 1233 Remove Sub-Folders from the Filesystem (Trie)

Given a list of foldersfolder, returnthe folders after removing allsub-foldersin those folders. You may return the answer inany order.If afolder[i]is located within anotherfolder[j], it is called asub-folderof it.The format of a path is one o...
原创
发布博客 2022.04.03 ·
481 阅读 ·
0 点赞 ·
0 评论

LeetCode 990 Satisfiability of Equality Equations (并查集 推荐)

You are given an array of stringsequationsthat represent relationships between variables where each stringequations[i]is of length4and takes one of two different forms:"xi==yi"or"xi!=yi".Here,xiandyiare lowercase letters (not necessarily diffe...
原创
发布博客 2022.03.20 ·
231 阅读 ·
0 点赞 ·
0 评论

LeetCode 1975 Maximum Matrix Sum (贪心)

You are given ann x nintegermatrix. You can do the following operationanynumber of times:Choose any twoadjacentelements ofmatrixandmultiplyeach of them by-1.Two elements are consideredadjacentif and only if they share aborder.Your goal ...
原创
发布博客 2022.03.20 ·
505 阅读 ·
0 点赞 ·
0 评论

LeetCode 1524 Number of Sub-arrays With Odd Sum (前缀和)

Given an array of integersarr, returnthe number of subarrays with anoddsum.Since the answer can be very large, return it modulo10^9+7.Example 1:Input: arr = [1,3,5]Output: 4Explanation: All subarrays are [[1],[1,3],[1,3,5],[3],[3,5],[5]]All ...
原创
发布博客 2022.03.19 ·
322 阅读 ·
0 点赞 ·
0 评论

LeetCode 688 Knight Probability in Chessboard (概率dp)

On ann x nchessboard, a knight starts at the cell(row, column)and attempts to make exactlykmoves. The rows and columns are0-indexed, so the top-left cell is(0, 0), and the bottom-right cell is(n - 1, n - 1).A chess knight has eight possible move...
原创
发布博客 2022.03.19 ·
241 阅读 ·
0 点赞 ·
0 评论

LeetCode 1054 Distant Barcodes (排序 贪心)

In a warehouse, there is a row of barcodes, where the ith barcode is barcodes[i].Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer, and it is guaranteed an answer exists.Example 1:Input: barcodes = [1,1,1,2
原创
发布博客 2022.03.18 ·
233 阅读 ·
0 点赞 ·
0 评论

LeetCode 1685 Sum of Absolute Differences in a Sorted Array (前缀和)

You are given an integer arraynumssorted innon-decreasingorder.Build and returnan integer arrayresultwith the same length asnumssuch thatresult[i]is equal to thesummation of absolute differencesbetweennums[i]and all the other elements in t...
原创
发布博客 2022.03.16 ·
837 阅读 ·
0 点赞 ·
0 评论

LeetCode 456 132 Pattern (单调栈 推荐)

Given an arrayofnintegersnums, a132 patternis a subsequence of three integersnums[i],nums[j]andnums[k]such thati < j < kandnums[i] < nums[k] < nums[j].Returntrueif there is a132 patterninnums, otherwise, returnfalse.Exam...
原创
发布博客 2022.03.11 ·
782 阅读 ·
0 点赞 ·
0 评论

LeetCode 881 Boats to Save People (两点法)

You are given an arraypeoplewherepeople[i]is the weight of theithperson, and aninfinite number of boatswhere each boat can carry a maximum weight oflimit. Each boat carries at most two people at the same time, provided the sum of the weight of tho...
原创
发布博客 2022.03.09 ·
43 阅读 ·
0 点赞 ·
0 评论

LeetCode 59 Spiral Matrix II (模拟)

Given a positive integer n, generate an n x n matrix filled with elements from 1 to n2 in spiral order.Example 1:Input: n = 3Output: [[1,2,3],[8,9,4],[7,6,5]]Example 2:Input: n = 1Output: [[1]]Constraints:1 <= n <= 20题目链接:https:/
原创
发布博客 2022.03.02 ·
71 阅读 ·
0 点赞 ·
0 评论
加载更多