icameling

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> same_set;
        unordered_set<int> num1_set(nums1.begin(), nums1.end());
        for (auto num : nums2) {
            if (num1_set.find(num) != num1_set.end())
                same_set.insert(num);
        }

icameling

class Solution {
public:
    bool isAnagram(string s, string t) {
        if (s.size() != t.size()) return false;

        int table[26] = {0};
        for (int i = 0; i < s.size(); ++i) {
            table[s[i] - 'a']++;
            table[t[i] - 'a']--;
        }

icameling

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

icameling

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

icameling

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */

icameling

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */

icameling

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */

icameling

class MyLinkedList {
    struct Node {
        int val;
        struct Node* next;
        Node(): val(0), next(NULL) {}
        Node(int v): val(v), next(NULL) {}
    };

    Node* head_;
    int size_;

icameling

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */

icameling

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        // 行 列
        vector<vector<int>> mat;
        for (int i = 0; i < n; ++i) {
            vector<int> tmp;
            for (int j = 0; j < n; ++j)
                tmp.push_back(0);
            mat.push_back(tmp);