update

Author: wangkhun

containsDuplicate.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    bool containsDuplicate(vector<int>& nums) {
+        map<int,int> res;
+        for(int i =0 ; i <nums.size(); i++) {
+            if(res.count(nums[i])){
+                return true;
+            }
+            res.insert(pair<int, int>(nums[i], i));
+        }
+        return false;
+    }
+};

deleteNode.cpp

@@ -0,0 +1,21 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode(int x) : val(x), next(NULL) {}
+ * };
+ */
+class Solution {
+	public:
+		void deleteNode(ListNode* node) {
+			if(node ==NULL)
+				return;
+			ListNode* nodeNext = node->next;
+			if(nodeNext){
+				int value = nodeNext->val;
+				node->value = value;
+				noe->enxt = nodeNext->next;
+			}
+		}
+}

findRelativeRanks.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    vector<string> findRelativeRanks(vector<int>& nums) {
+        vector<pair<int,int>> vec;
+        vector<string> res(nums.size());
+        string ranks[3] = {"Gold Medal", "Silver Medal", "Bronze Medal"};  
+        for( int i =0 ; i < nums.size(); i++)
+            vec.push_back(pair<int,int>(i, nums[i]));
+        auto cmp = [](const pair<int, int>& p1, const pair<int, int>& p2)
+        {
+            return p1.second >p2.second;
+        };
+        sort(vec.begin(), vec.end(), cmp);  
+  
+        for(int i = 0; i < nums.size(); ++i)  
+        {  
+            if(i < 3) res[vec[i].first] = ranks[i];  
+            else res[vec[i].first] = to_string(i+1);  
+        }  
+        return res; 
+        
+    }
+};

isAnagram.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+    bool isAnagram(string s, string t) {
+        vector<int> count(26,0);
+        for(int i = 0; i < s.length(); i++) {
+            count[s[i]-'a']++;
+        }
+        
+        for(int i = 0; i < t.length(); i++) {
+            count[t[i]-'a']--;
+            }
+        
+        for(int i = 0; i < count.size(); i++)
+        {
+            if(count[i] != 0)
+                return false;
+        }
+        
+        return true;
+    }
+};