CNoodle

2020年10月21日

[LeetCode] 606. Construct String from Binary Tree

摘要： You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be rep 阅读全文

posted @ 2020-10-21 04:47 CNoodle 阅读(162) 评论(0) 推荐(0)

[LeetCode] 536. Construct Binary Tree from String

摘要： You need to construct a binary tree from a string consisting of parenthesis and integers. The whole input represents a binary tree. It contains an int 阅读全文

posted @ 2020-10-21 02:14 CNoodle 阅读(365) 评论(0) 推荐(0)

[LeetCode] 925. Long Pressed Name

摘要： Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 阅读全文

posted @ 2020-10-21 00:30 CNoodle 阅读(160) 评论(0) 推荐(0)

2020年10月19日

[LeetCode] 652. Find Duplicate Subtrees

摘要： Given the root of a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to return the root node of any one 阅读全文

posted @ 2020-10-19 15:38 CNoodle 阅读(114) 评论(0) 推荐(0)

2020年10月18日

[LeetCode] 743. Network Delay Time

摘要： You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), w 阅读全文

posted @ 2020-10-18 12:52 CNoodle 阅读(239) 评论(0) 推荐(0)

[LeetCode] 1209. Remove All Adjacent Duplicates in String II

摘要： Given a string s, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them causing the left and the right side 阅读全文

posted @ 2020-10-18 04:36 CNoodle 阅读(330) 评论(0) 推荐(0)

[LeetCode] 1047. Remove All Adjacent Duplicates In String

摘要： Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them. We repeatedly make 阅读全文

posted @ 2020-10-18 04:24 CNoodle 阅读(190) 评论(0) 推荐(0)

2020年10月16日

[LeetCode] 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

摘要： Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any 阅读全文

posted @ 2020-10-16 02:19 CNoodle 阅读(937) 评论(0) 推荐(0)

2020年10月13日

[LeetCode] 859. Buddy Strings

摘要： Given two strings s and goal, return true if you can swap two letters in s so the result is equal to goal, otherwise, return false. Swapping letters i 阅读全文

posted @ 2020-10-13 01:04 CNoodle 阅读(151) 评论(0) 推荐(0)

2020年10月12日

[LeetCode] 530. Minimum Absolute Difference in BST

摘要： Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree. Exampl 阅读全文

posted @ 2020-10-12 05:10 CNoodle 阅读(244) 评论(0) 推荐(0)

2020年10月11日

[LeetCode] 1616. Split Two Strings to Make Palindrome

摘要： You are given two strings a and b of the same length. Choose an index and split both strings at the same index, splitting a into two strings: aprefix 阅读全文

posted @ 2020-10-11 15:41 CNoodle 阅读(420) 评论(0) 推荐(0)

[LeetCode] 1615. Maximal Network Rank

摘要： There is an infrastructure of n cities with some number of roads connecting these cities. Each roads[i] = [ai, bi] indicates that there is a bidirecti 阅读全文

posted @ 2020-10-11 13:47 CNoodle 阅读(1488) 评论(0) 推荐(0)

2020年10月7日

[LeetCode] 218. The Skyline Problem

摘要： A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Given the locations and 阅读全文

posted @ 2020-10-07 16:01 CNoodle 阅读(595) 评论(0) 推荐(0)

[LeetCode] 316. Remove Duplicate Letters

摘要： Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicogr 阅读全文

posted @ 2020-10-07 07:19 CNoodle 阅读(511) 评论(0) 推荐(0)

[LeetCode] 1396. Design Underground System

摘要： Implement the class UndergroundSystem that supports three methods: 1. checkIn(int id, string stationName, int t) A customer with id card equal to id, 阅读全文

posted @ 2020-10-07 05:22 CNoodle 阅读(520) 评论(0) 推荐(0)

[LeetCode] 1306. Jump Game III

摘要： Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + ar 阅读全文

posted @ 2020-10-07 00:48 CNoodle 阅读(438) 评论(0) 推荐(0)

2020年10月6日

[LeetCode] 1146. Snapshot Array

摘要： Implement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the given len 阅读全文

posted @ 2020-10-06 13:42 CNoodle 阅读(231) 评论(0) 推荐(0)

[LeetCode] 1370. Increasing Decreasing String

摘要： You are given a string s. Reorder the string using the following algorithm: Pick the smallest character from s and append it to the result. Pick the s 阅读全文

posted @ 2020-10-06 10:00 CNoodle 阅读(290) 评论(0) 推荐(0)

[LeetCode] 315. Count of Smaller Numbers After Self

摘要： You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smal 阅读全文

posted @ 2020-10-06 01:58 CNoodle 阅读(341) 评论(0) 推荐(0)

2020年10月5日

[LeetCode] 1586. Binary Search Tree Iterator II

摘要： Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST): BSTIterator(TreeNode root) Init 阅读全文

posted @ 2020-10-05 11:39 CNoodle 阅读(883) 评论(0) 推荐(0)

Let the code speak for you.

公告