1603. Design Parking System
常规解法：
class ParkingSystem {
public:
ParkingSystem(int big, int medium, int small) {
this->big = big;
this->medium = medium;
this->small = small;
}
bool addCar(int carType) {
switch(carType)
{
case 1:
if(big > 0){big--;return true;}else return false;break;......
232 Implement Queue using Stacks
实现原理是使用两个stack，每当peek或者pop时将stack in中的元素全部转移到out。借此实现先入先出。
最初始的代码实现为:
class MyQueue {
public:
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
in.push(x);
}
/** Removes the element from i......
Remove Duplicate
这道题目和1081. Smallest Subsequence of Distinct Characters是同一道题目，解题方法如下：
class Solution {
public:
string removeDuplicateLetters(string s) {
vector<int> dict(256, 0);
vector<bool> visited(256, false);
for(auto ch : s) dict[ch]++;
string result = "0";
/** the key idea is......
39. Combination Sum
这道题目应当是一类题目，这类题目有个统一的解法—回溯法(backtracking)
class Solution {
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<vector<int>> res;
vector<int> combination;
sort(candidates.begin(),candidates.end());
co......
315. Count of Smaller Numbers After Self
常规暴力破解解法：
class Solution {
public:
vector<int> countSmaller(vector<int>& nums) {
int n = nums.size();
vector<int> res;
for(int i = 0;i < n;i++)
{
int cnt = 0;
for(int j = i +1;j < n;j++)
{
if(nums[j] < nums[i])
cnt++;
}
res.......
1572.Matrix Diagonal Sum
常规解法如下，目前没发现有更好的方法，时间复杂度优于O(N).
class Solution {
public:
int diagonalSum(vector<vector<int>>& mat) {
int n = mat.size(),sum = 0;
for(int i = 0;i < n;i++)
{
sum += mat[i][i] + mat[i][n -1 -i];
}
//sub middle element,when n is odd,it add twice.
if(n......
48. Rotate Image
看了大神的这类翻转问题通用解法，
解这类问题就变得非常简单了。
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
reverse(matrix.begin(),matrix.end());
for(int i = 0;i < matrix.size();i++)
{
for(int j = i + 1;j < matrix[i].size();j++)
{
swap(matrix[i][j],matrix[j][i]);
......
1534 Count Good Triplets
无脑上暴力破解解法：
class Solution {
public:
int countGoodTriplets(vector<int>& arr, int a, int b, int c) {
int res = 0,n = arr.size();
for(int i = 0;i < n;i++)
{
for(int j = i + 1;j < n;j++)
{
for(int k = j + 1;k < n;k++)
{
if(abs(arr[i] - arr[j]) <= a &......
Given an array of positive integers arr, calculate the sum of all possible odd-length subarrays.
A subarray is a contiguous subsequence of the array.
Return the sum of all odd-length subarrays of arr.
Example 1:
Input: arr = [1,4,2,5,3]
Output: 58
Explanation: The odd-length subarrays of arr and t......
Balanced strings are those who have equal quantity of 'L' and 'R' characters.
Given a balanced string s split it in the maximum amount of balanced strings.
Return the maximum amount of splitted balanced strings.
Example 1:
Input: s = "RLRRLLRLRL"
Output: 4
Explanation: s can be split into "RL", "RR......