C/C++
文章平均质量分 70
木头不是哑巴
这个作者很懒,什么都没留下…
展开
-
43. Multiply Strings
43.Multiply StringsGiven two non-negative integersnum1andnum2represented as strings, return the product ofnum1andnum2, also represented as a string.Note:You must not use any built-in BigInteger library or convert the inputs to integer directly...转载 2021-04-17 13:16:16 · 104 阅读 · 1 评论 -
316. Remove Duplicate Letters
316.Remove Duplicate LettersGiven a strings, remove duplicate letters so that every letter appears once and only once. You must make sure your result isthe smallest in lexicographical orderamong all possible results.Note:This question is the same ...原创 2021-04-17 11:50:34 · 97 阅读 · 0 评论 -
C++ pair和make_pair的应用与实现
pair 的用法std::pair主要的作用是将两个数据组合成一个数据,两个数据可以是同一类型或者不同类型。 C++标准程序库中凡是“必须返回两个值”的函数, 也都会利用pair对象。 class pair可以将两个值视为一个单元。容器类别map和multimap就是使用pairs来管理其健值/实值(key/value)的成对元素。 pair被定义为struct,因此可直接存取pair中的个别值.。 两个pairs互相比较时, 第一个元素正具有较高的优先级.。make_pair的用法无需写转载 2021-04-11 14:21:51 · 784 阅读 · 0 评论 -
576. Out of Boundary Paths
576. Out of Boundary PathsThere is anmbyngrid with a ball. Given the start coordinate(i,j)of the ball, you can move the ball toadjacentcell or cross the grid boundary in four directions (up, down, left, right). However, you canat mostmoveNtim...转载 2020-08-13 01:03:03 · 131 阅读 · 0 评论 -
332. Reconstruct Itinerary
332.Reconstruct ItineraryGiven a list of airline tickets represented by pairs of departure and arrival airports[from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs fromJFK. Thus, the itinerary must begin with...转载 2020-08-08 00:28:56 · 145 阅读 · 0 评论 -
1530. Number of Good Leaf Nodes Pairs
1530. Number of Good Leaf Nodes PairsGiven therootof a binary tree and an integerdistance. A pair of two differentleafnodes of a binary tree is said to be good if the length ofthe shortest pathbetween them is less than or equal todistance.Retur...原创 2020-08-06 23:54:46 · 231 阅读 · 0 评论 -
132. Palindrome Partitioning II
132. Palindrome Partitioning II[LeetCode] Palindrome Partitioning II 拆分回文串之二Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs.Example:...转载 2020-07-18 22:46:01 · 129 阅读 · 0 评论 -
647. Palindromic Substrings
Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consist ...转载 2020-04-21 00:23:36 · 150 阅读 · 0 评论 -
494. Target Sum
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols+and-. For each integer, you should choose one from+and-as its new symbol.Find out how m...转载 2020-04-19 23:54:25 · 131 阅读 · 0 评论 -
[LeetCode] 416. Partition Equal Subset Sum
Given anon-emptyarray containingonly positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note:Each of the array eleme...转载 2020-04-19 23:24:38 · 129 阅读 · 0 评论 -
LeetCode 滑动窗口(Sliding Window)类问题总结
导语滑动窗口类问题是面试当中的高频题,问题本身其实并不复杂,但是实现起来细节思考非常的多,想着想着可能因为变量变化,指针移动等等问题,导致程序反复删来改去,有思路,但是程序写不出是这类问题最大的障碍。本文会将 LeetCode 里面的大部分滑动窗口问题分析、总结、分类,并提供一个可以参考的模版,相信可以有效减少面试当中的算法实现部分的不确定性。题目概览滑动窗口这类问题一般需要用到双...转载 2020-03-22 15:08:08 · 278 阅读 · 0 评论 -
Leetcode 310. Minimum Height Trees
For an undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called min...转载 2019-12-22 16:28:23 · 99 阅读 · 0 评论 -
322. Coin Change
322. Coin ChangeYou are given coins of different denominations and a total amount of moneyamount. Write a function to compute the fewest number of coins that you need to make up that amount. If tha...转载 2020-03-08 18:38:06 · 116 阅读 · 0 评论 -
硬币面值组合问题
转自:https://www.cnblogs.com/python27/p/3303721.html问题描述 假设我们有8种不同面值的硬币{1,2,5,10,20,50,100,200},用这些硬币组合够成一个给定的数值n。例如n=200,那么一种可能的组合方式为 200 = 3 * 1 + 1*2 + 1*5 + 2*20 + 1 * 50 + 1 * 100. 问总过有多少种可能的组...转载 2020-03-08 16:11:32 · 1102 阅读 · 0 评论 -
LeetCode-DP算法 | 最长公共子序列和最长公共子串区别
转自:https://blog.csdn.net/u012426298/article/details/82796660最长公共子串(Longest Common Substring)与最长公共子序列(Longest Common Subsequence)的区别: 子串要求在原字符串中是连续的,而子序列则只需保持相对顺序一致,并不要求连续。例如X = {a, Q, 1, 1}; Y = {a,...转载 2020-03-08 13:55:33 · 317 阅读 · 0 评论 -
560. Subarray Sum Equals K
560. Subarray Sum Equals KGiven an array of integers and an integerk, you need to find the total number of continuous subarrays whose sum equals tok.Example 1:Input:nums = [1,1,1], k = 2Outp...原创 2020-03-08 00:27:01 · 131 阅读 · 0 评论 -
Leetcode 309. Best Time to Buy and Sell Stock with Cooldown
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one ...原创 2020-01-15 00:05:07 · 126 阅读 · 0 评论 -
Leetcode 121. Best Time to Buy and Sell Stock I II
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock),...原创 2020-01-12 21:48:31 · 147 阅读 · 0 评论 -
Leetcode 198. House Robber I II III
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house...原创 2020-01-12 09:11:44 · 230 阅读 · 0 评论 -
Leetcode 91. Decode Ways
A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given anon-emptystring containing only digits, determine t...原创 2020-01-11 18:06:36 · 169 阅读 · 0 评论 -
279. Perfect Squares
Given a positive integern, find the least number of perfect square numbers (for example,1, 4, 9, 16, ...) which sum ton.Example 1:Input: n = 12Output: 3 Explanation: 12 = 4 + 4 + 4.Example...原创 2020-01-11 11:55:34 · 200 阅读 · 0 评论 -
Leetcode 343. Integer Break
Given a positive integern, break it into the sum ofat leasttwo positive integers and maximize the product of those integers. Return the maximum product you can get.Example 1:Input: 2Output: 1...原创 2020-01-10 08:20:06 · 178 阅读 · 0 评论 -
Leetcode 64. Minimum Path Sum
Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:You can only move either down or right at a...原创 2020-01-05 18:06:19 · 136 阅读 · 0 评论 -
Leetcode 120. 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 the following triangle[ [2], [3,4], [6,5...原创 2020-01-05 16:10:36 · 149 阅读 · 0 评论 -
Leetcode 236. Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to thedefinition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p...转载 2020-01-04 21:58:16 · 108 阅读 · 0 评论 -
LeetCode:127 Word Ladder
Given two words (beginWordandendWord), and a dictionary's word list, find the length of shortest transformation sequence frombeginWordtoendWord, such that:Only one letter can be changed at a ti...转载 2019-12-17 23:59:35 · 130 阅读 · 0 评论 -
LeetCode 210: Course Schedule II
There are a total ofncourses you have to take, labeled from0ton-1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair...原创 2019-12-15 23:14:50 · 132 阅读 · 0 评论 -
leetcode-863. All Nodes Distance K in Binary Tree
We are given a binary tree (with root noderoot), atargetnode, and an integer valueK.Return a list of the values of allnodes that have a distanceKfrom thetargetnode. The answer can be retur...转载 2019-12-15 23:11:57 · 154 阅读 · 1 评论 -
C++ 类模板与模板类详解
转自:https://www.cnblogs.com/cxq0017/p/6076856.html在C++的Template中很多地方都用到了typename与class这两个关键字,有时候这两者可以替换,那么这两个关键字是否完全一样呢? 事实上class用于定义类,在模板引入c++后,最初定义模板的方法为:template<class T>,这里class关键字表明T是一个类型,后...转载 2018-03-24 17:22:58 · 30876 阅读 · 0 评论