JinFei's Blog

Thinking will not overcome fear but action will.

[LeetCode]36. Valid Sudoku

检查数独是否有效

题目描述 Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: Each row must contain the digits 1-9 without repetition. E...

Posted by JinFei on August 20, 2021

[LeetCode]1339. Maximum Product of Splitted Binary Tree

二叉树左右子树之积

题目描述 Given the root of a binary tree, split the binary tree into two subtrees by removing one edge such that the product of the sums of the subtrees is maximized. Return the maximum product of...

Posted by JinFei on August 19, 2021

[LeetCode]2. 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 nodes contain a single digit. Add the two numbers a...

Posted by JinFei on August 19, 2021

[LeetCode]15. 3Sum

2Sum的变形，双指针的应用

题目描述 Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Example1: Given array...

Posted by JinFei on August 18, 2021

[LeetCode]91. Decode Ways

dp,字母的组合

题目描述 A message containing letters from A-Z is being encoded to numbers using the following mapping: ‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given a non-empty string containing...

Posted by JinFei on August 18, 2021

[LeetCode]160. Intersection of Two Linked Lists

链表的第一个交点

题目描述 Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: https://assets.leetcode.com/uploads/2018/12/1...

Posted by JinFei on August 18, 2021

[LeetCode]1448. Count Good Nodes in Binary Tree

查找与根路径较大的值

题目描述 Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. Return the number of good nodes in the binary tr...

Posted by JinFei on August 18, 2021

[LeetCode]Range Sum Query - Immutable

直方图思想

题目描述 Given an integer array nums, handle multiple queries of the following type: Calculate the sum of the elements of nums between indices left and right inclusive where left <= right. Impl...

Posted by JinFei on August 17, 2021

[LeetCode]283. Move Zeroes

移动0

题目描述 Given an integer array nums, move all 0’s to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the ...

Posted by JinFei on August 17, 2021

[LeetCode]1. Two Sum

模拟

题目描述 Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, a...

Posted by JinFei on August 13, 2021

FEATURED TAGS
iTools 剑指Offer dfs 排序 数据结构 栈 链表 dp 字符串 树 LeetCode 最大堆 STL使用 查找 二叉树 图 转载 STL backtracking BFS stack 分治 DFS 异或 冒泡排序 归并排序 回溯 递归 C C++基础 腾讯面试 递减栈 递增栈 贪心 位操作 双指针 math 前缀树 prefix tree 力扣 位运算 数学 双向链表 快排 多线程 二分搜索 旋转数组 优先级队列 直方图 BST 字符串操作 DP 异或运算
ABOUT ME

Goals determine what you going to be!

✉️ luojf@nbjl.nankai.edu.cn

FRIENDS