From 8f0602c9f1bc99a716459978ddf2a70b1e8b311c Mon Sep 17 00:00:00 2001 From: Evandro Nakayama Mota Date: Mon, 28 Oct 2019 17:06:18 -0300 Subject: [PATCH 1/2] Add LeetCode 231 --- leetcode/README.md | 1 + leetcode/src/231.c | 5 +++++ 2 files changed, 6 insertions(+) create mode 100644 leetcode/src/231.c diff --git a/leetcode/README.md b/leetcode/README.md index bb893c149..554b7117d 100644 --- a/leetcode/README.md +++ b/leetcode/README.md @@ -52,6 +52,7 @@ LeetCode |215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [C](./src/215.c)|Medium| |217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [C](./src/217.c)|Easy| |226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [C](./src/226.c)|Easy| +|231|[Power of Two](https://leetcode.com/problems/power-of-two/) | [C](./src/231.c)|Easy| |234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [C](./src/234.c)|Easy| |268|[Missing Number](https://leetcode.com/problems/missing-number/) | [C](./src/268.c)|Easy| |278|[First Bad Version](https://leetcode.com/problems/first-bad-version/) | [C](./src/278.c)|Easy| diff --git a/leetcode/src/231.c b/leetcode/src/231.c new file mode 100644 index 000000000..9957102f4 --- /dev/null +++ b/leetcode/src/231.c @@ -0,0 +1,5 @@ +bool isPowerOfTwo(int n){ + if (! n) return false; + while (n % 2 == 0) n /= 2; + return n == 1; +} \ No newline at end of file From aaa8a3149b25abea3e7784221695814d019c9c18 Mon Sep 17 00:00:00 2001 From: Evandro Nakayama Mota Date: Mon, 28 Oct 2019 17:30:18 -0300 Subject: [PATCH 2/2] Add LeetCode 242 --- leetcode/README.md | 1 + leetcode/src/242.c | 20 ++++++++++++++++++++ 2 files changed, 21 insertions(+) create mode 100644 leetcode/src/242.c diff --git a/leetcode/README.md b/leetcode/README.md index 554b7117d..3adf0b70b 100644 --- a/leetcode/README.md +++ b/leetcode/README.md @@ -54,6 +54,7 @@ LeetCode |226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [C](./src/226.c)|Easy| |231|[Power of Two](https://leetcode.com/problems/power-of-two/) | [C](./src/231.c)|Easy| |234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [C](./src/234.c)|Easy| +|242|[Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [C](./src/242.c)|Easy| |268|[Missing Number](https://leetcode.com/problems/missing-number/) | [C](./src/268.c)|Easy| |278|[First Bad Version](https://leetcode.com/problems/first-bad-version/) | [C](./src/278.c)|Easy| |283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/) | [C](./src/283.c)|Easy| diff --git a/leetcode/src/242.c b/leetcode/src/242.c new file mode 100644 index 000000000..2fd06fb27 --- /dev/null +++ b/leetcode/src/242.c @@ -0,0 +1,20 @@ +bool isAnagram(char * s, char * t){ + int n = strlen(s); + int m = strlen(t); + + int cnt_s[1000], cnt_t[1000]; + for (int c = 97; c < 97 + 26; c++) + cnt_s[c] = cnt_t[c] = 0; + + for (int i = 0; i < n; i++) + cnt_s[s[i]]++; + + for (int i = 0; i < m; i++) + cnt_t[t[i]]++; + + for (int c = 97; c < 97 + 26; c++) + if (cnt_s[c] != cnt_t[c]) + return false; + + return true; +}