DmitriiKosenko
/ gist:14710945b00ac81c60da6b7902cc76c1
Created
November 17, 2021 14:01
https://leetcode.com/problems/implement-strstr/ O(n^2)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| int strStr(string haystack, string needle) { | |
| if (needle.length() == 0) return 0; | |
| if (haystack.length() == 0) return -1; | |
| if (needle.length() > haystack.length()) return -1; | |
| if (haystack.length() == needle.length()) { | |
| for (int i = 0; i < haystack.length(); i++) { | |
| if (haystack[i] != needle[i]) return -1; |
DmitriiKosenko
/ gist:b35e960676f51feb45928c664cbcc1fb
Created
November 17, 2021 13:59
https://leetcode.com/problems/implement-strstr/ O(n)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| int strStr(string haystack, string needle) { | |
| if (needle.length() == 0) return 0; | |
| if (haystack.length() == 0) return -1; | |
| if (needle.length() > haystack.length()) return -1; | |
| if (haystack.length() == needle.length()) { | |
| for (int i = 0; i < haystack.length(); i++) { | |
| if (haystack[i] != needle[i]) return -1; |
DmitriiKosenko
/ gist:762d5ef6ae6157bee8d98a53d60731e7
Created
November 14, 2021 10:41
https://leetcode.com/problems/two-sum/ O(n)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| vector<int> twoSum(vector<int>& nums, int target) { | |
| vector<int> result; | |
| if (nums.size() == 2) { | |
| result.push_back(0); | |
| result.push_back(1); | |
| return result; | |
| } | |
DmitriiKosenko
/ gist:2b910128d1f02c9a98ca1689ad6e89ca
Last active
November 14, 2021 10:43
https://leetcode.com/problems/two-sum/ O(n^2)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| vector<int> twoSum(vector<int>& nums, int target) { | |
| vector<int> result; | |
| if (nums.size() == 2) { | |
| result.push_back(0); | |
| result.push_back(1); | |
| return result; | |
| } | |