初学者的专栏

key： head node & two pointers Runtime: 4 ms / beats 3.86% Reference:discuss/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x)

key: math Runtime: 11 ms / beats 38.09% No referenceclass Solution { public: int titleToNumber(string s) { int col = 0; for(char i : s) { col = col * 26 + (i -

key: map Runtime: 232 ms No referenceclass Solution { public: bool canConstruct(string ransomNote, string magazine) { bool res = true; map<char, int> m; for(auto i : magaz

key: Linked List Runtime: 16 ms / beats 15.47% No reference/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(

key: map–find & count Runtime: 16 ms / beats 19.77% No referenceclass Solution { public: vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { vector<int> res; map<in

key: map Runtime: 44 ms/ beats 9.23% Reference: blogpublic: int majorityElement(vector<int>& nums) { map<int,int> mapcnt; map<int,int>::iterator iter; for(int i = 0; i < n

key: recursion Runtime: 0 ms / beats 17.62% No reference/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(i

key： two pointers Runtime: 20 ms / beats 27.77% No referenceclass Solution { public: void moveZeroes(vector<int>& nums) { int cnt = 0; for(int i = 0; i < nums.size(); i++)

key: recursion Runtime: 0 ms / beats 22.92% No reference/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(i

key: recursion Runtime: 8 ms / beats 24.48% No reference/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(i

key: note that 9%9=0, and -1%9 = -1 Runtime: 8 ms/ beats 52.315 Reference: discussclass Solution { public: int addDigits(int num) { return 1+(num - 1)%9; } };

key: xor to get the sum, & to get the carry, use recursion Runtime: 0 ms/ beats 11.31% Reference:discussclass Solution { public: int getSum(int a, int b) { if(a == 0) return b

key: traverse from backward Runtime: 16 ms / beats 9.99% No referenceclass Solution { public: string reverseString(string s) { string res(s); for(int i = s.size()-1; i>=0; i--)

key: judge if the lists end Runtime: 8 ms / beats 73.38% No reference/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : va

key: stack & special condition Runtime: 0 ms / beats 15.90% No referenceclass Solution { public: bool isValid(string s) { if(s.size()%2 != 0) return false; stack<char>

key: two pointers, one runs fast than the other n+1 steps Runtime: 4 ms / beats 37.25% Reference:discuss/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode

LeetCode#13 Roman to Integerkey: traverse the string from backwards Runtime: 44 ms / beats 52.85% Reference:discuss//I(1),X(10),C(100),M(1000),V(5),L(50),D(500) class Solution { public: int roman

key: here A to Z represent to 1 - 26 , so preform n - 1 in each loop to change it to 0 - 25 Runtime: 0 ms / beats 11.37% Reference:discussclass Solution { public: string convertToTitle(int n) {