id int64 0 755k | file_name stringlengths 3 109 | file_path stringlengths 13 185 | content stringlengths 31 9.38M | size int64 31 9.38M | language stringclasses 1
value | extension stringclasses 11
values | total_lines int64 1 340k | avg_line_length float64 2.18 149k | max_line_length int64 7 2.22M | alphanum_fraction float64 0 1 | repo_name stringlengths 6 65 | repo_stars int64 100 47.3k | repo_forks int64 0 12k | repo_open_issues int64 0 3.4k | repo_license stringclasses 9
values | repo_extraction_date stringclasses 92
values | exact_duplicates_redpajama bool 2
classes | near_duplicates_redpajama bool 2
classes | exact_duplicates_githubcode bool 2
classes | exact_duplicates_stackv2 bool 1
class | exact_duplicates_stackv1 bool 2
classes | near_duplicates_githubcode bool 2
classes | near_duplicates_stackv1 bool 2
classes | near_duplicates_stackv2 bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
42,054 | friend_fun.cpp | gatieme_CodingInterviews/048-不能被继承的类/friend_fun.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class SealedClass
{
private :
SealedClass( ){ }
~SealedClass( ){ }
public :
friend SealedClass* GetInstance( );
};... | 556 | C++ | .cpp | 30 | 14.066667 | 40 | 0.633333 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,055 | final.cpp | gatieme_CodingInterviews/048-不能被继承的类/final.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
template <typename T>
class CNoHeritance
{
friend T;
private:
CNoHeritance(){ }
~CNoHeritance(){ }
};
class Se... | 633 | C++ | .cpp | 37 | 12.837838 | 61 | 0.625 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,056 | static_value.cpp | gatieme_CodingInterviews/048-不能被继承的类/static_value.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class SealedClass
{
public :
static SealedClass* GetInstance( )
{
if(m_sc == NULL)
{
m_sc = ne... | 860 | C++ | .cpp | 44 | 13.318182 | 51 | 0.54047 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,057 | static_func.cpp | gatieme_CodingInterviews/048-不能被继承的类/static_func.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class SealedClass
{
public :
static SealedClass* GetInstance( )
{
return new SealedClass( );
}
private :
... | 522 | C++ | .cpp | 29 | 13.37931 | 44 | 0.617068 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,059 | replacespace.cpp | gatieme_CodingInterviews/004-替换空格/replacespace.cpp | #include <iostream>
using namespace std;
#define __tmain main
class Solution
{
public:
void replaceSpace(char *str,int length)
{
int i = length - 1, j;
int len = length;
// 从后往前遍历
for(i = length - 1; i >= 0; i--)
{
//cout <<str[i] <<endl;
// 如... | 917 | C++ | .cpp | 40 | 13.45 | 48 | 0.371429 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,063 | findpath_left_static.cpp | gatieme_CodingInterviews/025-二叉树中和为某一值的路径/findpath_left_static.cpp | #include <iostream>
#include <vector>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
// TreeNode(int x... | 2,542 | C++ | .cpp | 106 | 15.990566 | 69 | 0.461214 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,067 | 02-align_length.cpp | gatieme_CodingInterviews/037-两个链表的第一个公共结点/02-align_length.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
public :
int val;
struct ListNode *next;
};
#endif // #endif __tmai... | 2,555 | C++ | .cpp | 104 | 15.451923 | 75 | 0.475075 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,069 | 03-map.cpp | gatieme_CodingInterviews/037-两个链表的第一个公共结点/03-map.cpp | #include <iostream>
#include <map>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
public :
int val;
struct ListNode *next;
};
#endif // ... | 1,657 | C++ | .cpp | 71 | 16.43662 | 75 | 0.535761 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,070 | power_3.cpp | gatieme_CodingInterviews/011-数值的整数次方/power_3.cpp | #include <iostream>
#include <bitset>
#include <cmath>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
double Power(double base, int exponent)
{
// 指数为0的情况，不管底数是多少都应该是0
if(e... | 1,837 | C++ | .cpp | 82 | 13.585366 | 78 | 0.450909 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | true | false | false |
42,074 | mirror_in.cpp | gatieme_CodingInterviews/019-二叉树的镜像/mirror_in.cpp | #include <iostream>
#include <stack>
#include <algorithm>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x),... | 1,625 | C++ | .cpp | 67 | 14.223881 | 62 | 0.470795 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,075 | mirror_re.cpp | gatieme_CodingInterviews/019-二叉树的镜像/mirror_re.cpp | #include <iostream>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL)
{
}
... | 752 | C++ | .cpp | 44 | 12.477273 | 38 | 0.557803 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,076 | mirror_pre.cpp | gatieme_CodingInterviews/019-二叉树的镜像/mirror_pre.cpp | #include <iostream>
#include <stack>
#include <algorithm>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x),... | 1,978 | C++ | .cpp | 89 | 13.157303 | 61 | 0.437976 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,077 | mirror_post.cpp | gatieme_CodingInterviews/019-二叉树的镜像/mirror_post.cpp | #include <iostream>
#include <stack>
#include <algorithm>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x),... | 1,969 | C++ | .cpp | 72 | 16.458333 | 124 | 0.432232 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,078 | 02-divide2.cpp | gatieme_CodingInterviews/032-从1到n整数中1出现的次数/02-divide2.cpp | #include <iostream>
#include <cmath>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
/**
* [NumberOf1Between1AndN_Solution 统计1到n的整数中1出现的次数]
* @Author gatieme
... | 2,460 | C++ | .cpp | 77 | 20.285714 | 99 | 0.420935 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,079 | 03-num.cpp | gatieme_CodingInterviews/032-从1到n整数中1出现的次数/03-num.cpp | #include <iostream>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
/**
* [NumberOf1Between1AndN_Solution 统计1到n的整数中1出现的次数]
* @Author gatieme
* @DateTime 2016-05-01T22:0... | 2,099 | C++ | .cpp | 61 | 21.852459 | 90 | 0.446739 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,080 | 02-divide.cpp | gatieme_CodingInterviews/032-从1到n整数中1出现的次数/02-divide.cpp | #include <iostream>
#include <cmath>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
/**
* [NumberOf1Between1AndN_Solution 统计1到n的整数中1出现的次数]
* @Author gatieme
... | 3,236 | C++ | .cpp | 95 | 20.315789 | 103 | 0.35964 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,081 | 01-bruteforce.cpp | gatieme_CodingInterviews/032-从1到n整数中1出现的次数/01-bruteforce.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
/**
* [NumberOf1Between1AndN_Solution 统计1到n的整数中1出现的次数]
* @Author gatieme
* @DateTime 2016-... | 1,501 | C++ | .cpp | 60 | 16.816667 | 61 | 0.487877 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,083 | 05-hash.cpp | gatieme_CodingInterviews/036-数组中的逆序对/05-hash.cpp | #include <iostream>
#include <vector>
#include <iterator>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
/*
我的解法是O(10*n)，剑指offer是O(nlogn)
思路如下：
借助一个数组hash，统计array从后往前，到第i位时候... | 1,909 | C++ | .cpp | 57 | 17.561404 | 66 | 0.521199 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,084 | 03-selectsort.cpp | gatieme_CodingInterviews/036-数组中的逆序对/03-selectsort.cpp | #include <iostream>
#include <vector>
#include <iterator>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
///////////////////////////////////
// error
///////////////////////////////////
class Solution
{
pub... | 1,438 | C++ | .cpp | 45 | 19.844444 | 78 | 0.470691 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,087 | bruteforce.cpp | gatieme_CodingInterviews/003-二维数组中的查找/bruteforce.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution
{
public:
bool Find(vector<vector<int> > array,int target)
{
int row = 0, col = 0, t = 0;
bool isFound = false;
for(int i = 0; i < array.size( ) ; ++i)
{
for(int j = 0; j < array[i].size( );... | 611 | C++ | .cpp | 25 | 14.48 | 61 | 0.423488 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,090 | int_to_string.cpp | gatieme_CodingInterviews/062-序列化二叉树/int_to_string.cpp | #include <iostream>
#include <vector>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
/*
* string to int
*/
#ifndef... | 1,723 | C++ | .cpp | 66 | 19.439394 | 62 | 0.591065 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,091 | recursion_sstream.cpp | gatieme_CodingInterviews/062-序列化二叉树/recursion_sstream.cpp | #include <iostream>
#include <vector>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
... | 2,898 | C++ | .cpp | 115 | 16.773913 | 74 | 0.521553 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,092 | string_to_int.cpp | gatieme_CodingInterviews/062-序列化二叉树/string_to_int.cpp | #include <iostream>
#include <vector>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
/*
* string to int
*/
// 使用a... | 1,469 | C++ | .cpp | 60 | 18.25 | 62 | 0.605746 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,093 | recursion_string.cpp | gatieme_CodingInterviews/062-序列化二叉树/recursion_string.cpp | #include <iostream>
#include <vector>
#include <sstream>
#include <cstring>
#include <cstdio>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
... | 3,622 | C++ | .cpp | 135 | 16.540741 | 74 | 0.506822 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,094 | inorder_stack.cpp | gatieme_CodingInterviews/063-二叉搜索树的第K个结点/inorder_stack.cpp | #include <iostream>
#include <stack>
using namespace std;
//http://blog.csdn.net/zuoyixiao/article/details/39525625
//http://blog.csdn.net/asd7486/article/details/51800096
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef... | 2,748 | C++ | .cpp | 103 | 15.990291 | 58 | 0.4827 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,097 | minnumber-On2.cpp | gatieme_CodingInterviews/008-旋转数组的最小数字/minnumber-On2.cpp | #include <iostream>
#include <vector>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define dout cout
#else
#define dout 0 && cout
#endif // __tmain
class Solution
{
public:
int minNumberInRotateArray(vector<int> rotateArray)
{
for(int i = 0; i < rota... | 974 | C++ | .cpp | 42 | 14.666667 | 61 | 0.509195 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,102 | 04-reverse_temp.cpp | gatieme_CodingInterviews/042-翻转单词顺序列/04-reverse_temp.cpp | #include <iostream>
#include <algorithm>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
string ReverseSentence(string str)
{
string result;
while (str.rf... | 864 | C++ | .cpp | 36 | 16.888889 | 59 | 0.530151 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,103 | 01-reverse.cpp | gatieme_CodingInterviews/042-翻转单词顺序列/01-reverse.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
string ReverseSentence(string str)
{
if(str.size( ) == 0)
{
return "";
... | 1,831 | C++ | .cpp | 69 | 14.275362 | 64 | 0.41507 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,104 | 04-reverse_temp2.cpp | gatieme_CodingInterviews/042-翻转单词顺序列/04-reverse_temp2.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
string ReverseSentence(string str)
{
if(str.size( ) == 0)
{
return str;
}
string ... | 1,008 | C++ | .cpp | 45 | 13.466667 | 63 | 0.430524 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,105 | 03-reverse_stack.cpp | gatieme_CodingInterviews/042-翻转单词顺序列/03-reverse_stack.cpp | #include <iostream>
#include <stack>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
//使用两个栈
class Solution
{
public:
string ReverseSentence(string str)
{
if (str.size( ) == 0)
{... | 2,188 | C++ | .cpp | 66 | 16.969697 | 82 | 0.446154 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,106 | 02-reverse_stl.cpp | gatieme_CodingInterviews/042-翻转单词顺序列/02-reverse_stl.cpp | #include <iostream>
#include <algorithm>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
string ReverseSentence(string str)
{
if (str.size( ) == 0)
{
... | 1,595 | C++ | .cpp | 53 | 16.773585 | 75 | 0.462366 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,107 | 04-multiset.cpp | gatieme_CodingInterviews/030-最小的K个数/04-multiset.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator> //istream_iterator,ostream_iterator,back_inserter
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
... | 3,355 | C++ | .cpp | 113 | 20.646018 | 84 | 0.499533 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,108 | 02-heap.cpp | gatieme_CodingInterviews/030-最小的K个数/02-heap.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
class greater_class
{
public:
bool operator()(int a, int b)
{
... | 1,593 | C++ | .cpp | 58 | 19.448276 | 110 | 0.535466 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,109 | 01-sort.cpp | gatieme_CodingInterviews/030-最小的K个数/01-sort.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
protected:
vector<int> m_res;
public:
vector<int> GetLeastNumbers_Solution(v... | 4,401 | C++ | .cpp | 144 | 20.930556 | 95 | 0.457079 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,111 | print_recursion.cpp | gatieme_CodingInterviews/005-从尾到头打印链表/print_recursion.cpp | #include <iostream>
#include <stack>
#include <vector>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define dout cout
#else
#define dout 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
public :
int val;
struct ListNode *next;
/*ListNode(int x) :
val(x),... | 1,296 | C++ | .cpp | 66 | 15.621212 | 65 | 0.557965 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,112 | print_recursion2.cpp | gatieme_CodingInterviews/005-从尾到头打印链表/print_recursion2.cpp | #include <iostream>
#include <stack>
#include <vector>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define dout cout
#else
#define dout 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
public :
int val;
struct ListNode *next;
/*ListNode(int x) :
val(x),... | 1,459 | C++ | .cpp | 70 | 16.7 | 82 | 0.577517 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,114 | findkth2.cpp | gatieme_CodingInterviews/015-链表中倒数第k个结点/findkth2.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
public :
int val;
struct ListNode *next;
// ListNode(int x) :
// val(x), next(NULL)
// {
// }
};
#endif // __tmain
... | 2,057 | C++ | .cpp | 88 | 16.772727 | 73 | 0.520263 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,115 | findkth1.cpp | gatieme_CodingInterviews/015-链表中倒数第k个结点/findkth1.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
public :
int val;
struct ListNode *next;
// ListNode(int x) :
// val(x), next(NULL)
// {
// }
};
#endif // __tmain
... | 2,134 | C++ | .cpp | 90 | 16.933333 | 73 | 0.528282 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,116 | functemplate.cpp | gatieme_CodingInterviews/046-求1+2+3+...+n/functemplate.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
template < unsigned int n>
struct Sum
{
enum Value
{
N = Sum< n - 1 >::N + n
};
};
template <>
struct Sum<1... | 464 | C++ | .cpp | 30 | 10.4 | 32 | 0.538462 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,117 | funcpoint.cpp | gatieme_CodingInterviews/046-求1+2+3+...+n/funcpoint.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class base;
base *parray[2];
class base{
public:
virtual unsigned int sum(unsigned int n)
{
// 递归的终止
ret... | 942 | C++ | .cpp | 45 | 13.511111 | 45 | 0.548015 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,118 | bitmulti.cpp | gatieme_CodingInterviews/046-求1+2+3+...+n/bitmulti.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int res;
int Sum_Solution(int n)
{
res = 0;
return (MultiRecursion(n, n + 1) >> ... | 696 | C++ | .cpp | 32 | 15.78125 | 60 | 0.52188 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,119 | recursion.cpp | gatieme_CodingInterviews/046-求1+2+3+...+n/recursion.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int Sum_Solution(int n)
{
return 0;
}
int SumRecursion(int n)
{
int ... | 587 | C++ | .cpp | 31 | 13.064516 | 45 | 0.552326 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,123 | 01-bruteforce.cpp | gatieme_CodingInterviews/034-丑数/01-bruteforce.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public :
// 输出第index个丑数
int GetUglyNumber_Solution(int index)
{
if(index <= 0)
... | 1,194 | C++ | .cpp | 56 | 12.339286 | 83 | 0.429241 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,125 | convert_stack.cpp | gatieme_CodingInterviews/027-二叉搜索树与双向链表/convert_stack.cpp | #include <iostream>
#include <stack>
using namespace std;
//
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
// TreeNode(int x)
// :val(x), left(NULL), right(NULL)... | 2,504 | C++ | .cpp | 104 | 15.480769 | 57 | 0.466782 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,127 | convert_re2.cpp | gatieme_CodingInterviews/027-二叉搜索树与双向链表/convert_re2.cpp | #include <iostream>
using namespace std;
//
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
// TreeNode(int x)
// :val(x), left(NULL), right(NULL)
// {
// }
};
#en... | 3,519 | C++ | .cpp | 128 | 18.367188 | 93 | 0.494396 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,129 | dfs.cpp | gatieme_CodingInterviews/053-正则表达式匹配/dfs.cpp | #include <iostream>
using namespace std;
#define __tmain main
class Solution
{
public:
bool match(char* str, char* regex)
{
if(*str == NULL) // 空串的情况, 可以匹配' ', '*'
{
if(*regex == NULL
|| (*(regex + 1) == '*' && match(str, regex + 2)))
{
... | 1,863 | C++ | .cpp | 72 | 11.402778 | 65 | 0.283713 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,131 | multiply.cpp | gatieme_CodingInterviews/052-构建乘积数组/multiply.cpp | #include <iostream>
#include <vector>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
vector<int> multiply(const vector<int>& A)
{
int n = A.size();
v... | 805 | C++ | .cpp | 37 | 14.621622 | 54 | 0.422343 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,133 | stack.cpp | gatieme_CodingInterviews/059-对称的二叉树/stack.cpp | #include <iostream>
#include <deque>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNod... | 2,945 | C++ | .cpp | 115 | 16.556522 | 62 | 0.453909 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,136 | print_recursion.cpp | gatieme_CodingInterviews/012-打印1到最大的N位数/print_recursion.cpp | #include <iostream>
#include <cstring>
using namespace std;
// 调试开关
#define DEBUG
#define __tmain main
#ifdef DEBUG
#define debug cout
#else
#define debug 0 && cout
#endif // DEBUG
class Solutin
{
public :
void PrintToMaxOfNDigits(int n)
{
if(n <= 0)
{
return ;
}
... | 1,694 | C++ | .cpp | 74 | 15.175676 | 87 | 0.471746 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,137 | print.cpp | gatieme_CodingInterviews/012-打印1到最大的N位数/print.cpp | #include <iostream>
#include <cmath>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solutin
{
public :
void Print(int n)
{
int max = pow(10, n);
for(int i = 1; i < max; i++)
{
... | 488 | C++ | .cpp | 32 | 10.78125 | 36 | 0.535797 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,138 | print_recursion2.cpp | gatieme_CodingInterviews/012-打印1到最大的N位数/print_recursion2.cpp | #include <iostream>
#include <cstring>
using namespace std;
// 调试开关
#define DEBUG
#define __tmain main
#ifdef DEBUG
#define debug cout
#else
#define debug 0 && cout
#endif // DEBUG
class Solutin
{
public :
void PrintToMaxOfNDigits(int n)
{
if(n <= 0)
{
return ;
}
... | 1,759 | C++ | .cpp | 76 | 15.421053 | 87 | 0.47561 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,142 | entry2.cpp | gatieme_CodingInterviews/056-链表中环的入口结点/entry2.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
int val;
struct ListNode *next;
};
#endif // __tmain
#define SLOW_STEP 1
#defin... | 1,289 | C++ | .cpp | 58 | 15.413793 | 51 | 0.53133 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,144 | maxqueue_s.cpp | gatieme_CodingInterviews/065-滑动窗口的最大值/maxqueue_s.cpp | #include <iostream>
#include <vector>
#include <deque>
#include <iterator>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
/* 单调队列，O(n)
* deque s中存储的是num的下标
*
* 题目：滑动窗口的最大值
*
* 思路：滑动窗口应当是队列，但... | 2,520 | C++ | .cpp | 69 | 19.898551 | 81 | 0.51017 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,146 | bruteforce.cpp | gatieme_CodingInterviews/065-滑动窗口的最大值/bruteforce.cpp | #include <iostream>
#include <vector>
#include <deque>
#include <iterator>
#include <climits>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
/* 单调队列，O(n)
* 引用马客（Mark）的解题思路，马客没加注释，我用自己的理解加下注释，希望对你们有... | 1,704 | C++ | .cpp | 56 | 18.696429 | 73 | 0.475107 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,147 | heap.cpp | gatieme_CodingInterviews/065-滑动窗口的最大值/heap.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <iterator>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public :
typedef pair<int, int> Pair;
vector<int>... | 1,626 | C++ | .cpp | 55 | 20.036364 | 84 | 0.47372 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,148 | maxqueue.cpp | gatieme_CodingInterviews/065-滑动窗口的最大值/maxqueue.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <iterator>
#include <climits>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public :
/* 方式二：利用队列来解决,时间复杂度为O(n)
... | 2,857 | C++ | .cpp | 84 | 18.190476 | 71 | 0.467435 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,149 | stack_queue.cpp | gatieme_CodingInterviews/065-滑动窗口的最大值/stack_queue.cpp | #include <iostream>
#include <vector>
#include <iterator>
#include <climits>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#define MAX 100
class Stack
{
private:
int stackItem[MAX];
in... | 3,275 | C++ | .cpp | 140 | 14.492857 | 71 | 0.461363 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,152 | levelorder_reverse.cpp | gatieme_CodingInterviews/061-按之字形顺序打印二叉树/levelorder_reverse.cpp | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#define undebug 0 && cout
#ifdef __tmain
struct TreeNode {
int val;
struct TreeNode *left;
... | 2,066 | C++ | .cpp | 89 | 15.88764 | 57 | 0.485024 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,153 | levelorder_stack.cpp | gatieme_CodingInterviews/061-按之字形顺序打印二叉树/levelorder_stack.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#define undebug 0 && cout
#ifdef __tmain
struct TreeNode {
int val;
str... | 3,320 | C++ | .cpp | 119 | 16.731092 | 54 | 0.447571 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,155 | reverselist2.cpp | gatieme_CodingInterviews/016-反转链表/reverselist2.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
public :
int val;
struct ListNode *next;
};
#endif // __tmain
class Solution
{
public:
ListNode* ReverseList(Lis... | 1,979 | C++ | .cpp | 85 | 16.282353 | 63 | 0.503429 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,157 | count.cpp | gatieme_CodingInterviews/057-删除链表中重复的结点/count.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
int val;
struct ListNode *next;
ListNode(int x = 0)
:
val(x), next(NULL... | 1,891 | C++ | .cpp | 79 | 15 | 59 | 0.478774 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,161 | 01-rotate2.cpp | gatieme_CodingInterviews/042-左旋转字符串/01-rotate2.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
string LeftRotateString(string str, int n)
{
/// abcXYZdef
/// abcXYZdefabcXYZdef
... | 738 | C++ | .cpp | 34 | 14 | 57 | 0.539432 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,163 | 02-reverse.cpp | gatieme_CodingInterviews/042-左旋转字符串/02-reverse.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
string LeftRotateString(string str, int n)
{
if(str.size( ) == 0)
{
... | 953 | C++ | .cpp | 41 | 15.634146 | 64 | 0.496536 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,164 | flag.cpp | gatieme_CodingInterviews/051-数组中重复的数字/flag.cpp | #include <iostream>
#include <cstring>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
// Parameters:
// numbers: an array of integers
// length: the length of array ... | 1,817 | C++ | .cpp | 72 | 17.388889 | 106 | 0.491114 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,165 | hashset.cpp | gatieme_CodingInterviews/051-数组中重复的数字/hashset.cpp | #include <iostream>
#include <set>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
// Parameters:
// numbers: an array of integers
// length: ... | 1,964 | C++ | .cpp | 76 | 16.973684 | 107 | 0.482643 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,166 | addlength.cpp | gatieme_CodingInterviews/051-数组中重复的数字/addlength.cpp | #include <iostream>
#include <set>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
// Parameters:
// numbers: an array of integers
// length: ... | 1,882 | C++ | .cpp | 70 | 17.714286 | 107 | 0.473988 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,167 | swap.cpp | gatieme_CodingInterviews/051-数组中重复的数字/swap.cpp | #include <iostream>
#include <set>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
// Parameters:
// numbers: an array of integers
// length: ... | 2,447 | C++ | .cpp | 75 | 21.373333 | 107 | 0.476385 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,168 | sort.cpp | gatieme_CodingInterviews/051-数组中重复的数字/sort.cpp | #include <iostream>
#include <algorithm>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
// Parameters:
// numbers: an array of integers
// lengt... | 1,967 | C++ | .cpp | 71 | 17.985915 | 107 | 0.478507 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,169 | 0flag.cpp | gatieme_CodingInterviews/051-数组中重复的数字/0flag.cpp | #include <iostream>
#include <cstring>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#define SET_SYMBOL_BIT(num) ((num) |= (1 << 31)) /* 设置符号位为1 */
#define GET_ORIGIN_NUM(num) ((num) & (~(1 << 31))) /* 获取到源数据 */
#defi... | 2,322 | C++ | .cpp | 77 | 20.363636 | 144 | 0.505361 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,170 | permutation_error.cpp | gatieme_CodingInterviews/028-字符串的排列/permutation_error.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
protected:
vector<string> m_res;
public:
/* 依次从字符串中取出一个字符作为最终排列的第一个字符，
... | 1,336 | C++ | .cpp | 55 | 16.6 | 98 | 0.5196 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,171 | permutation.cpp | gatieme_CodingInterviews/028-字符串的排列/permutation.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
protected:
vector<string> m_res;
public:
v... | 1,760 | C++ | .cpp | 67 | 17.104478 | 112 | 0.460695 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,173 | next_permutation.cpp | gatieme_CodingInterviews/028-字符串的排列/next_permutation.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
vector<string> Permutation(string str)
... | 765 | C++ | .cpp | 38 | 13.657895 | 59 | 0.535151 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,175 | multiset.cpp | gatieme_CodingInterviews/064-数据流之中的中位数/multiset.cpp | #include <iostream>
#include <vector>
#include <set>
#include <iterator>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
protected :
multiset<int> left; /* 左半部分 */
... | 2,202 | C++ | .cpp | 82 | 18.02439 | 77 | 0.43616 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,176 | oj.cpp | gatieme_CodingInterviews/template/oj.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
// 调试开关
#define DEBUG
#ifdef DEBUG
#define debug cout
#define dprintf printf
#else
#define debug 0 && cout
#define dprintf 0 && printf
#endif // DEBUG
int main( )
{
freop... | 532 | C++ | .cpp | 24 | 16.75 | 40 | 0.5671 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,177 | template.cpp | gatieme_CodingInterviews/template/template.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
int __tmain( )
{
debug <<"test" <<endl;
return 0;
}
| 259 | C++ | .cpp | 14 | 13.642857 | 27 | 0.629108 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,180 | merge1.cpp | gatieme_CodingInterviews/017-合并两个排序的链表/merge1.cpp | #include <iostream>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#ifdef __tmain
struct ListNode
{
public :
int val;
struct ListNode *next;
// ListNode(int x)
// :val(x), next(NULL)
// {
/... | 1,478 | C++ | .cpp | 70 | 14.228571 | 55 | 0.500733 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,181 | 05-map.cpp | gatieme_CodingInterviews/029-数组中出现次数超过一半的数字/05-map.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int MoreThanHalfNum_Solution(vector<int> numbers)
{
map<int, int> hmap; ... | 1,340 | C++ | .cpp | 54 | 16.648148 | 57 | 0.498765 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,183 | 02-partition.cpp | gatieme_CodingInterviews/029-数组中出现次数超过一半的数字/02-partition.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int MoreThanHalfNum_Solution(vector<int> numbers)
{
if(numbers.size( ) == 0)
{
... | 5,606 | C++ | .cpp | 160 | 24.3125 | 114 | 0.46457 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,185 | 03-holdfield.cpp | gatieme_CodingInterviews/029-数组中出现次数超过一半的数字/03-holdfield.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int MoreThanHalfNum_Solution(vector<int> numbers)
{
if(numbers.size( ) == 0)
{
... | 1,881 | C++ | .cpp | 75 | 15.773333 | 79 | 0.431065 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,186 | bit_add.cpp | gatieme_CodingInterviews/047-不用加减乘除做加法/bit_add.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int Add(int left, int right)
{
int temp;
while(right != 0)
{
temp = left ^ right; ... | 818 | C++ | .cpp | 35 | 16.2 | 83 | 0.533619 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,187 | inline_asm.cpp | gatieme_CodingInterviews/047-不用加减乘除做加法/inline_asm.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int Add(int left, int right)
{
__asm__ __volatile__
(
//"lock;\n"
"addl %1,%0;\n" ... | 581 | C++ | .cpp | 31 | 12.774194 | 56 | 0.498039 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,190 | 03-firstlast_stlbound.cpp | gatieme_CodingInterviews/038-数字在排序数组中出现的次数/03-firstlast_stlbound.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int GetNumberOfK(vector<int> data ,int k)
{
int upper = u... | 649 | C++ | .cpp | 28 | 18.107143 | 60 | 0.595601 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,191 | 03-firstlast.cpp | gatieme_CodingInterviews/038-数字在排序数组中出现的次数/03-firstlast.cpp | #include <iostream>
#include <vector>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int GetNumberOfK(std::vector<int> array, int k)
{
if (array.size( ) == 0)... | 2,740 | C++ | .cpp | 111 | 12.774775 | 73 | 0.350417 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,192 | 01-bruteforce.cpp | gatieme_CodingInterviews/038-数字在排序数组中出现的次数/01-bruteforce.cpp | #include <iostream>
#include <vector>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int GetNumberOfK(vector<int> data,int k)
{
if(data.size( ) == 0)
... | 832 | C++ | .cpp | 40 | 13.05 | 46 | 0.457105 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,195 | find2.cpp | gatieme_CodingInterviews/040-数组中只出现一次的数字/find2.cpp | #include <iostream>
#include <vector>
#include <bitset>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
#define INT_SIZE (sizeof(int) * 8)
#define IS_BIT(number, index) ((... | 1,533 | C++ | .cpp | 56 | 18.625 | 72 | 0.454996 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,196 | bruteforce.cpp | gatieme_CodingInterviews/024-二叉搜索树的后序遍历序列/bruteforce.cpp | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
//下面这种迭代的方法时间复杂度为O(n^2)
bool VerifySquenceOfBST_Iteratively(const ... | 1,377 | C++ | .cpp | 46 | 19.043478 | 71 | 0.623872 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,197 | ispost_max.cpp | gatieme_CodingInterviews/024-二叉搜索树的后序遍历序列/ispost_max.cpp | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
/// 后序是 左右根
/// 那么我们的节点
bool VerifySquenceOfBST(vector<int> s... | 1,534 | C++ | .cpp | 62 | 15.645161 | 72 | 0.434626 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,198 | ispost_n2.cpp | gatieme_CodingInterviews/024-二叉搜索树的后序遍历序列/ispost_n2.cpp | #include <iostream>
#include <vector>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
bool VerifySquenceOfBST(vector<int> sequence)
{
if(sequence.size( ) == 0)
... | 1,533 | C++ | .cpp | 62 | 14.419355 | 52 | 0.443382 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,199 | ispost_n.cpp | gatieme_CodingInterviews/024-二叉搜索树的后序遍历序列/ispost_n.cpp | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution {
public:
/*
step1：最后一个为根节点；
step2：从根节点的左边开始往前遍历，找到第一个比它大的节点作为右子树，记为right
step3：从右子... | 1,745 | C++ | .cpp | 64 | 18.65625 | 63 | 0.537627 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,201 | reOrderArray.cpp | gatieme_CodingInterviews/014-调整数组顺序使奇数位于偶数前面/reOrderArray.cpp | #include <iostream>
#include <vector>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
void reOrderArray(vector<int> &array)
{
if(array.size( ) <= 1)
{
retur... | 1,507 | C++ | .cpp | 62 | 15.16129 | 70 | 0.441349 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,202 | otherarray.cpp | gatieme_CodingInterviews/014-调整数组顺序使奇数位于偶数前面/otherarray.cpp | #include <iostream>
#include <vector>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
void reOrderArray(vector<int> &array)
{
if(array.size( ) <= 1)
{
return ;
... | 1,334 | C++ | .cpp | 60 | 14.75 | 60 | 0.457683 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,206 | numberof1_3.cpp | gatieme_CodingInterviews/010-二进制中1的个数/numberof1_3.cpp | #include <iostream>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int NumberOf1(int n)
{
int count = 0;
while(n)
{
++count;
n = (n - 1) & ... | 633 | C++ | .cpp | 34 | 14.117647 | 47 | 0.568493 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,207 | numberof1_1.cpp | gatieme_CodingInterviews/010-二进制中1的个数/numberof1_1.cpp | #include <iostream>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int NumberOf1(int n)
{
int count = 0;
// 当输入负数的时候会出现死循环
while(n)
{
if(n & 1 == 1... | 678 | C++ | .cpp | 36 | 12.666667 | 52 | 0.501634 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,208 | numberof1_4.cpp | gatieme_CodingInterviews/010-二进制中1的个数/numberof1_4.cpp | #include <iostream>
#include <bitset>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int NumberOf1(int n)
{
bitset<32> bit(n);
return bit.count();
}
};
#include <cm... | 535 | C++ | .cpp | 29 | 15.137931 | 47 | 0.639511 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,209 | numberof1_2.cpp | gatieme_CodingInterviews/010-二进制中1的个数/numberof1_2.cpp | #include <iostream>
using namespace std;
// µ÷ÊÔ¿ª¹Ø
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int NumberOf1(int n)
{
int count = 0;
int i = 0;
unsigned int flag = 1;
while(flag != 0)... | 879 | C++ | .cpp | 41 | 15.658537 | 65 | 0.491484 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,210 | stack.cpp | gatieme_CodingInterviews/021-包含min函数的栈/stack.cpp | #include <iostream>
#include <stack>
#include <cassert>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#define MIN(x, y) ((x) < (y) ? (x) : (y))
class Solution
{
public:
void push(int value)
{
... | 1,433 | C++ | .cpp | 61 | 16.836066 | 69 | 0.458207 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,213 | printmartix2.cpp | gatieme_CodingInterviews/020-顺时针打印矩阵/printmartix2.cpp | #include <iostream>
#include <vector>
#include <cassert>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
int n, m;
vector<vector<bool> > v;
bool judge(int i, int j)
{
return 0 <= i ... | 1,736 | C++ | .cpp | 69 | 18.84058 | 64 | 0.433537 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,235 | joseph.cpp | gatieme_CodingInterviews/045-孩子们的游戏(圆圈中最后剩下的数)/joseph.cpp | #include <iostream>
#include <vector>
#include <iterator>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int LastRemaining_Solution(unsigned int n, unsigned int m)
{
... | 1,504 | C++ | .cpp | 55 | 20.8 | 63 | 0.439405 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,236 | joseph_recursion.cpp | gatieme_CodingInterviews/045-孩子们的游戏(圆圈中最后剩下的数)/joseph_recursion.cpp | #include <iostream>
#include <vector>
#include <iterator>
using namespace std;
// 调试开关
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
public:
int LastRemaining_Solution(unsigned int n, unsigned int m)
{
... | 1,090 | C++ | .cpp | 46 | 17.043478 | 63 | 0.478218 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
42,239 | 02-dp.cpp | gatieme_CodingInterviews/031-连续子数组的最大和/02-dp.cpp | #include <iostream>
#include <vector>
#include <iterator>
#include <climits>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
class Solution
{
int dp[1000];
public:
int FindGreatestSumOfSubArray(vecto... | 2,064 | C++ | .cpp | 73 | 19.09589 | 78 | 0.445202 | gatieme/CodingInterviews | 4,829 | 1,127 | 10 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.