原題鏈接在這里：https://leetcode.com/problems/remove-k-digits/description/ 題目： Given a non-negative integer?num?represented as a string, remove?k?digits from the number so that the new number is the smallest possible. Note: The length of?nu

? ? Implement Trie (Prefix Tree)208. Implement Trie (Prefix Tree)Add and Search Word - Data structure design211. Add and Search Word - Data structure designWord Search II?212. Word Search IIPalindrome Pairs? leetcode中文。轉載于:https://www.cnblogs.com/r

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of?every?node never differ by more than 1. 思考：求二叉樹高的變形，加上

1.題目描述 Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest

Given a singly linked list, determine if it is a palindrome. ? 思路： 回文結構從后向前遍歷與從前向后遍歷的結果是相同的，可以利用一個棧的結構，將出棧元素與正向移動的指針指向元素比較，即可判斷。 ? leetcode all in one。解法： 1

題目鏈接 題目：當 A 的子數組 A[i], A[i+1], …, A[j] 滿足下列條件時，我們稱其為湍流子數組： 若 i <= k < j，當 k 為奇數時， A[k] > A[k+1]，且當 k 為偶數時，A[k] < A[k+1]； 或 若 i &

1.兩數之和 解法1：暴力遍歷 class Solution { public:vector<int> twoSum(vector<int>& nums, int target) {for(int i=0;i<nums.size();i++){for(int j=i+1;j<nums.size();j++){if(nums[i]+nums[j]==t

1.題目描述 Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. 給一個數字字符串，返回所有可能的字母組合。 leetcode all in

#include <iostream> #include <vector> #include <unordered_map>// 時間復雜度是O(n), 空間復雜度O(n) using namespace std;class Solution1 { public:int longestConsecutive(const vector<int> &nums){unordered_map<int, bool> used;

題目描述：(鏈接) Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. 解題思路: 上代碼 1 class Solution { 2 public: 3 vector<