2019-5-23

Author: JiayangWu

0002.两数相加/0002-两数相加.cpp

@@ -0,0 +1,30 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode(int x) : val(x), next(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
+        ListNode* res = new ListNode(-1);
+        ListNode* cur = res;
+        int carry = 0;
+        while(l1 || l2){
+            int t1 = l1? l1->val : 0;
+            int t2 = l2? l2->val : 0;
+            int sum = t1 + t2 + carry;
+            carry = sum / 10;
+            cur->next = new ListNode(sum % 10);
+            cur = cur->next;
+            if (l1) l1 = l1->next;
+            if (l2) l2 = l2->next;
+        }
+        if (carry) cur->next =new ListNode(1);
+        return res->next;
+        
+        
+    }
+};

0003.无重复字符的最长子串/0003-无重复字符的最长子串.cpp

@@ -0,0 +1,28 @@
+class Solution {
+public:
+    int lengthOfLongestSubstring(string s) {
+    
+        string dic = "";
+        int ans = 0;
+        int i = 0;
+        int j = 0;
+        int l = s.size();
+        while( i < l && j < l ){
+            char a = s[i];
+            char b = s[j];
+            // cout<<dic.find(b)<<endl;
+            if (dic.find(b) >= 0 && dic.find(b) < 99999999){
+                i += 1;
+                dic.erase(0, 1); 
+            }
+            else{
+                j += 1;
+                dic.push_back(b);
+                // cout << "Dasdas" << endl;
+            }
+            ans = ans < j-i ? j-i : ans;
+            // cout <<i<<" "<<j << endl;
+        }
+        return ans;
+    }
+};