xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-13 12:20:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-02-08 22:16:25 +08:00
parent 30ed83e5b1
commit af3542e3c0
17 changed files with 258 additions and 100 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_computational_complexity/space_time_tradeoff.md
+20 -24
View File
@@ -139,22 +139,20 @@ comments: true
=== "C#"
```csharp title="leetcode_two_sum.cs"
class SolutionBruteForce
/* 方法一：暴力枚举 */
int[] twoSumBruteForce(int[] nums, int target)
{
public int[] twoSum(int[] nums, int target)
int size = nums.Length;
// 两层循环，时间复杂度 O(n^2)
for (int i = 0; i < size - 1; i++)
{
int size = nums.Length;
// 两层循环，时间复杂度 O(n^2)
for (int i = 0; i < size - 1; i++)
for (int j = i + 1; j < size; j++)
{
for (int j = i + 1; j < size; j++)
{
if (nums[i] + nums[j] == target)
return new int[] { i, j };
}
if (nums[i] + nums[j] == target)
return new int[] { i, j };
}
return new int[0];
}
return new int[0];
}
```
@@ -321,24 +319,22 @@ comments: true
=== "C#"
```csharp title="leetcode_two_sum.cs"
class SolutionHashMap
/* 方法二：辅助哈希表 */
int[] twoSumHashTable(int[] nums, int target)
{
public int[] twoSum(int[] nums, int target)
int size = nums.Length;
// 辅助哈希表，空间复杂度 O(n)
Dictionary<int, int> dic = new();
// 单层循环，时间复杂度 O(n)
for (int i = 0; i < size; i++)
{
int size = nums.Length;
// 辅助哈希表，空间复杂度 O(n)
Dictionary<int, int> dic = new();
// 单层循环，时间复杂度 O(n)
for (int i = 0; i < size; i++)
if (dic.ContainsKey(target - nums[i]))
{
if (dic.ContainsKey(target - nums[i]))
{
return new int[] { dic[target - nums[i]], i };
}
dic.Add(nums[i], i);
return new int[] { dic[target - nums[i]], i };
}
return new int[0];
dic.Add(nums[i], i);
}
return new int[0];
}
```