fix: db.json

Author: xingbofeng

solutions/001.two-sum/db.json

@@ -0,0 +1 @@
+{"python":"class Solution:\r\n  def twoSum(self, nums, target):\r\n    length = len(nums)\r\n    hashmap = {}\r\n    for i in range(0,length):\r\n      x = nums[i]\r\n      if target - x in hashmap:\r\n        return [hashmap[target -x], i]\r\n      else:\r\n        hashmap[x] = i"}

solutions/002.add-two-numbers/db.json

@@ -0,0 +1 @@
+{"c":"/**\n * Definition for singly-linked list.\n * struct ListNode {\n *     int val;\n *     struct ListNode *next;\n * };\n */\nstruct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {\n\tstruct ListNode *result, *currentNode, *headNode;\n\theadNode = NULL;\n\tint flag = 0;\n    while(l1 != NULL && l2 !=NULL) {\n    \tcurrentNode = (struct ListNode *)malloc(sizeof(struct ListNode));\n    \tcurrentNode->next = NULL;\n    \tif(l1->val + l2->val + flag > 9) {\n    \t\tcurrentNode->val = l1->val + l2->val + flag - 10;\n    \t\tflag = 1;\n\t\t} else {\n\t\t\tcurrentNode->val = l1->val + l2->val + flag;\n\t\t\tflag = 0;\n\t\t}\n\t\tif (headNode == NULL) {\n\t\t\theadNode = currentNode;\n\t\t} else {\n\t\t\tresult->next = currentNode;\n\t\t}\n\t\tresult = currentNode;\n\t\tl1 = l1->next;\n\t\tl2 = l2->next;\n\t}\n\twhile(l1 != NULL) {\n\t\tcurrentNode = (struct ListNode *)malloc(sizeof(struct ListNode));\n\t\tcurrentNode->next = NULL;\n\t\tif(l1->val + flag > 9){\n\t\t\tcurrentNode->val = l1->val + flag - 10;\n\t\t\tflag = 1;\n\t\t} else {\n\t\t\tcurrentNode->val = l1->val + flag;\n\t\t\tflag = 0;\n\t\t}\n\t\tresult->next = currentNode;\n\t\tresult = currentNode;\n\t\tl1 = l1->next;\n\t}\n\twhile(l2 != NULL) {\n\t\tcurrentNode = (struct ListNode *)malloc(sizeof(struct ListNode));\n\t\tcurrentNode->next = NULL;\n\t\tif(l2->val + flag > 9){\n\t\t\tcurrentNode->val = l2->val + flag - 10;\n\t\t\tflag = 1;\n\t\t} else {\n\t\t\tcurrentNode->val = l2->val + flag;\n\t\t\tflag = 0;\n\t\t}\n\t\tresult->next = currentNode;\n\t\tresult = currentNode;\n\t\tl2 = l2->next;\n\t}\n\tif(flag != 0) {\n\t\tcurrentNode = (struct ListNode *)malloc(sizeof(struct ListNode));\n\t\tcurrentNode->next = NULL;\n\t\tcurrentNode->val = flag;\n\t\tresult->next = currentNode;\n\t}\n\treturn headNode;\n}"}

solutions/003.longest-substring-without-repeating-characters/db.json

@@ -0,0 +1 @@
+{"javascript":"var lengthOfLongestSubstring = function(s) {\n    var hashmap = {};\n    var result = 0;\n    var left = 0;\n    var j = left;\n    while(j < s.length) {\n        if (hashmap[s[j]] !== undefined) {\n            left = Math.max(hashmap[s[j]] + 1, left);\n        }\n        result = Math.max(result, j - left + 1);\n        hashmap[s[j]] = j++;\n    }\n    return result;\n};"}

solutions/007.reverse-integer/db.json

@@ -0,0 +1 @@
+{"c":"int reverse(int x) {\n  long long reverseNum = 0;\n    while(x != 0) {\n      long long y = x % 10;\n      x = x / 10;\n      reverseNum = 10 * reverseNum + y;\n    }\n    return (reverseNum < INT_MIN || reverseNum > INT_MAX) ? 0 : reverseNum;\n}"}

solutions/009.palindrome-number/db.json

@@ -0,0 +1 @@
+{"python":"class Solution(object):\n    def isPalindrome(self, x):\n      if x < 0:\n        return False\n      elif x == 0:\n        return True\n      else :\n        prenum = x\n        reverse = 0\n        while x != 0:\n          y = x % 10\n          x = int(x / 10)\n          reverse = y + 10 * reverse\n        return reverse == prenum"}

solutions/013.roman-to-integer/db.json

@@ -0,0 +1 @@
+{"python":"class Solution(object):\n    def romanToInt(self, s):\n      hashmap = {\n        'I': 1,\n        'V': 5,\n        'X': 10,\n        'L': 50,\n        'C': 100,\n        'D': 500,\n        'M': 1000\n      };\n      result = 0;\n      for i in range(0,len(s)):\n        if i == 0:\n          result += hashmap[s[i]]\n        elif hashmap[s[i - 1]] >= hashmap[s[i]]:\n          result += hashmap[s[i]]\n        elif hashmap[s[i - 1]] < hashmap[s[i]]:\n          print(i)\n          result += hashmap[s[i]] - 2 * hashmap[s[i - 1]]\n      return result"}

solutions/014.longest-common-prefix/db.json

@@ -0,0 +1 @@
+{"c++":"class Solution {\npublic:\n    string longestCommonPrefix(vector<string> &strs) {\n        if (strs.empty()){\n          return \"\";\n        }\n        string result = \"\";\n        for (int i = 0; i < strs[0].size(); ++i) { // 对第一个字符串每个位置循环\n          char ch = strs[0][i];\n          for (int j = 0; j < strs.size(); ++j) { // 判断第j个字符串的第i个位置是否与第一个字符串相等\n            if (strs[j][i] !=ch || i == strs[j].size()) {\n              // 如果有不相等的或者已经循环到某个字符串的末尾，直接返回\n              return result;\n            }\n          }\n          // 否则把现今字符入栈\n          result.push_back(ch);\n        }\n        return result;\n    }\n};"}

solutions/019.remove-nth-node-from-end-of-list/db.json

@@ -0,0 +1 @@
+{"c":"/**\n * Definition for singly-linked list.\n * struct ListNode {\n *     int val;\n *     struct ListNode *next;\n * };\n */\nstruct ListNode* removeNthFromEnd(struct ListNode* head, int n) {\n    struct ListNode** p = &head, *q = head;\n    for(int i = 0;i < n;i++) {\n        q = q->next;\n    }\n    while(q != NULL) {\n        p = &((*p)->next);\n        q = q->next;\n    }\n    *p = (*p)->next;\n    return head;\n}"}

solutions/026.remove-duplicates-from-sorted-array/db.json

@@ -0,0 +1 @@
+{"c":"int removeDuplicates(int* nums, int numsSize) {\n    if (numsSize == 0) {\n        return 0;\n    }\n    int result = numsSize;\n    for(int i = 0; i < numsSize - 1; i++) {\n        if (nums[i] == nums[i + 1]) {\n            result--;\n        } else {\n            nums[i - (numsSize - result) + 1] = nums[i + 1];\n        }\n    }\n    return result;\n}"}

solutions/027.remove-element/db.json

@@ -0,0 +1 @@
+{"c++":"class Solution {\npublic:\n  int removeElement(vector<int>& nums, int val) {\n    if (nums.size() == 0) {\n      return 0;\n    }\n    int number = 0;\n    for (int i = 0; i < nums.size(); ++i) {\n      if (nums[i] == val) {\n        number++;\n      }\n    }\n    int temp;\n    for (int i = 0; i < nums.size() - 1; ++i) {\n      for (int j = i + 1; j < nums.size(); ++j) {\n        if (nums[j] != val) {\n          temp = nums[i];\n          nums[i] = nums[j];\n          nums[j] = temp;\n        }\n      }\n    }\n    return (nums.size() - number);\n  }\n};"}

solutions/056.merge-intervals/db.json

@@ -0,0 +1 @@
+{"javascript":"var merge = function(intervals) {\n    if (intervals.length === 0) {\n        return [];\n    }\n    var stack = [];\n    intervals.sort((a, b) => a.start - b.start);\n    stack.push(intervals[0])\n    for (var i = 1; i < intervals.length; i++) {\n        if (intervals[i].start <= stack[stack.length - 1].end) {\n            stack[stack.length - 1].end = (intervals[i].end > stack[stack.length - 1].end) ? intervals[i].end : stack[stack.length - 1].end;\n        } else {\n            stack.push(intervals[i]);\n        }\n    }\n    return stack;\n};"}

solutions/061.rotate-list/db.json

@@ -0,0 +1 @@
+{"c":"struct ListNode* rotateRight(struct ListNode* head, int k) {\n  if (head == NULL) {\n    return NULL;\n  }\n  if (k == 0) {\n    return head;\n  }\n  struct ListNode** p = &head, *q = head, *a;\n  a = (struct ListNode *)malloc(sizeof(struct ListNode));\n  for (int i = 0; i < k; i++) {\n    q = q->next;\n    if (q == NULL) {\n      k = k % (i + 1);\n      i = -1;\n      q = *p;\n    }\n  }\n  if (q == *p) {\n    return *p;\n  }\n  while (q->next != NULL) {\n    p = &((*p)->next);\n    q = q->next;\n  }\n  a = (*p)->next;\n  q->next = head;\n  (*p)->next = NULL;\n  return a;\n}"}

solutions/result.json

@@ -1 +1 @@
-{"1":{"id":1,"level":1,"title":"two-sum","language":["python3"]},"2":{"id":2,"level":2,"title":"add-two-numbers","language":["c"]},"3":{"id":3,"level":2,"title":"longest-substring-without-repeating-characters","language":["javascript"]},"7":{"id":7,"level":1,"title":"reverse-integer","language":["c"]},"9":{"id":9,"level":1,"title":"palindrome-number","language":["python"]},"13":{"id":13,"level":1,"title":"roman-to-integer","language":["python"]},"14":{"id":14,"level":1,"title":"longest-common-prefix","language":["c++"]},"19":{"id":19,"level":2,"title":"remove-nth-node-from-end-of-list","language":["c"]},"26":{"id":26,"level":1,"title":"remove-duplicates-from-sorted-array","language":["c"]},"27":{"id":27,"level":1,"title":"remove-element","language":["c++"]},"56":{"id":56,"level":2,"title":"merge-intervals","language":["javascript"]},"61":{"id":61,"level":2,"title":"rotate-list","language":["c"]},"lastUpdatedTime":"2017-07-27","total":573,"solved":12,"locked":107}
+{"1":{"id":1,"level":1,"title":"two-sum","language":["python"],"generated":true},"2":{"id":2,"level":2,"title":"add-two-numbers","language":["c"],"generated":true},"3":{"id":3,"level":2,"title":"longest-substring-without-repeating-characters","language":["javascript"],"generated":true},"7":{"id":7,"level":1,"title":"reverse-integer","language":["c"],"generated":true},"9":{"id":9,"level":1,"title":"palindrome-number","language":["python"],"generated":true},"13":{"id":13,"level":1,"title":"roman-to-integer","language":["python"],"generated":true},"14":{"id":14,"level":1,"title":"longest-common-prefix","language":["c++"],"generated":true},"19":{"id":19,"level":2,"title":"remove-nth-node-from-end-of-list","language":["c"],"generated":true},"26":{"id":26,"level":1,"title":"remove-duplicates-from-sorted-array","language":["c"],"generated":true},"27":{"id":27,"level":1,"title":"remove-element","language":["c++"],"generated":true},"56":{"id":56,"level":2,"title":"merge-intervals","language":["javascript"],"generated":true},"61":{"id":61,"level":2,"title":"rotate-list","language":["c"],"generated":true},"lastUpdatedTime":"2017-07-27","total":573,"solved":12,"locked":107}