Commit2404bd5

committed

Sovle solution #1.two sum in cpp

1 parent3deab42 commit2404bd5Copy full SHA for 2404bd5

File tree

+76

-0

lines changed

+76

-0

lines changed

Lines changed: 10 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,10 @@`
	`1`	`+cmake_minimum_required(VERSION 3.16.5)`
	`2`	`+project(leetcode_cpp)`
	`3`	`+`
	`4`	`+set(`
	`5`	`+SOURCE_FILES`
	`6`	`+Source/main.cpp`
	`7`	`+Source/Algorithms/1.two-sum.cpp`
	`8`	`+)`
	`9`	`+`
	`10`	`+add_executable(${PROJECT_NAME}${SOURCE_FILES})`

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+/*`
	`2`	`+ * @lc app=leetcode id=1 lang=cpp`
	`3`	`+ *`
	`4`	`+ * [1] Two Sum`
	`5`	`+*/`
	`6`	`+`
	`7`	`+// @lc code=start`
	`8`	`+#include<vector>`
	`9`	`+#include<unordered_map>`
	`10`	`+`
	`11`	`+classSolution`
	`12`	`+{`
	`13`	`+public:`
	`14`	`+ std::vector<int>twoSum(std::vector<int> &nums,int target)`
	`15`	`+ {`
	`16`	`+ std::unordered_map<int,int> numToIndex;`
	`17`	`+ numToIndex[nums[0]] =0;`
	`18`	`+for (int i =1; i < nums.size(); i++)`
	`19`	`+ {`
	`20`	`+int complement = target - nums[i];`
	`21`	`+if (numToIndex.find(complement) != numToIndex.end())`
	`22`	`+ {`
	`23`	`+return {numToIndex[complement], i};`
	`24`	`+ }`
	`25`	`+ numToIndex[nums[i]] = i;`
	`26`	`+ }`
	`27`	`+return {};`
	`28`	`+ };`
	`29`	`+};`
	`30`	`+`
	`31`	`+// @lc code=end`

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+#include<chrono>`
	`2`	`+#include<iostream>`
	`3`	`+#include<ratio>`
	`4`	`+#include<vector>`
	`5`	`+`
	`6`	`+#include"Algorithms/1.two-sum.cpp"`
	`7`	`+`
	`8`	`+intmain(int argc,charconst *argv[])`
	`9`	`+{`
	`10`	`+// Init`
	`11`	`+int target =9;`
	`12`	`+ std::vector<int> nums{2,7,11,15};`
	`13`	`+`
	`14`	`+// Start timer`
	`15`	`+auto start =std::chrono::steady_clock::now();`
	`16`	`+// Execute`
	`17`	`+ Solution solution =Solution();`
	`18`	`+ std::vector<int> result = solution.twoSum(nums, target);`
	`19`	`+`
	`20`	`+for (int i : result)`
	`21`	`+ {`
	`22`	`+ std::cout << i <<"";`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ std::cout << std::endl;`
	`26`	`+`
	`27`	`+// End timer`
	`28`	`+auto end =std::chrono::steady_clock::now();`
	`29`	`+auto diff = end - start;`
	`30`	`+ std::cout`
	`31`	`+ << std::chrono::duration<double, std::milli>(diff).count()`
	`32`	`+ <<" ms" << std::endl;`
	`33`	`+`
	`34`	`+return0;`
	`35`	`+}`

Comments

(0)