此刻心情:想着巩固一下基础,提高一下自身的算法水准,故在前辈的推荐下前来刷LeetCode,还请各位看官勿喷,对于刷题的demo代码如果有更优的解法,欢迎留言,欢迎吐槽,欢迎交流,邮箱whalecanfly@163.com, 计划是在每天刷3道题,等到后续时间充足的时候我会放入Python的刷题版本,目前该系列为C++刷题。程序人生, fighting!!!
1.Two Sum
Description:Two Sum | LeetCode OJ
翻译为中文:描述:给定一个整数数组和一个值target,求两个下标i、j,使得a[i] + a[j] = target,返回下标。
Demo代码如下:
#include "stdafx.h"
#include <unordered_map>
using std::unordered_map;
using std::vector;
vector<int> TwoSum(vector<int>& nums ,int Target)
{
unordered_map<int, int> hash;//使用无序map作为存储空间
vector<int> result;
for (int i = 0; i < nums.size(); i++)
{
int numberToFind = Target - nums[i];
if (hash.find(numberToFind) != hash.end())
{
result.push_back(hash[numberToFind] + 1);
result.push_back(i + 1);
return result;
}
hash[nums[i]] = i;
}
return result;
}
int main()
{
int nums[4] = { 2, 7, 11, 15 };
int Target = 9;
vector<int> NumbersSelect(nums, nums + 4);//利用数组初始化vector
vector<int> TempVector = TwoSum(NumbersSelect, Target);
}
02 Add Two Numbers
Description:Add Two Numbers | LeetCode OJ
翻译为中文:描述:两个大数,用链表表示。做个加法。
主要函数如下:
ListNode* AddTwoNumbers(ListNode* l1, ListNode *l2)
{
ListNode* pTempFirst = NULL;
ListNode* pTempSecond = NULL;
ListNode pResult = ListNode(0);
ListNode* pResultHead = &pResult;
int AddNumber = 0;
pTempFirst = l1;
pTempSecond = l2;
while (pTempFirst || pTempSecond || AddNumber)
{
pResultHead->pNext = new ListNode((pTempFirst->val + pTempSecond->val + AddNumber) % THE_BIT_SCALE);
pResultHead = pResultHead->pNext;
AddNumber = pTempFirst->val + pTempSecond->val >= THE_BIT_SCALE ? 1 : 0;
pTempFirst = pTempFirst? pTempFirst->pNext : pTempFirst;
pTempSecond = pTempSecond? pTempSecond->pNext : pTempSecond;
}
return pResult.pNext;
}
03 Longest Substring Without Repeating Characters
Description:Longest Substring Without Repeating Characters | LeetCode OJ
Translate:字母不带重样儿的最长子串
Discuss中提供的答案比自己写的好很多,故此题最优解为官方提供:
int lengthOfLongestSubstring(string s) {
vector<int> dict(256, -1);
int maxLen = 0, start = -1;
for (int i = 0; i != s.length(); i++) {
if (dict[s[i]] > start)
start = dict[s[i]];
dict[s[i]] = i;
maxLen = max(maxLen, i - start);
}
return maxLen;
}
完成1~3题,打卡。Time:2018/03/04