Skip to content

Commit 5bf8f5a

Browse files
0xmountaintopChrisLinn
0xmountaintop
authored and
ChrisLinn
committed
add get_sum (#22)
1 parent ab75341 commit 5bf8f5a

File tree

5 files changed

+84
-16
lines changed

5 files changed

+84
-16
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -65,10 +65,10 @@ cargo test
6565
0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/missing-number.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/missing-number.py) <br>------br> [Rust](./kamyu104/src/missing_number.rs) | _O(n)_ | _O(1)_ | Medium | LintCode ||
6666
0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-product-of-word-lengths.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-product-of-word-lengths.py) <br>------br> [Rust](./kamyu104/src/maximum_product_of_word_lengths.rs) | _O(n)_ ~ _O(n^2)_ | _O(n)_ | Medium || Bit Manipulation, Counting Sort, Pruning|
6767
0342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-four.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-four.py) <br>------br> [Rust](./kamyu104/src/power_of_four.rs) | _O(1)_ | _O(1)_ | Easy | |
68+
0371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/sum-of-two-integers.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/sum-of-two-integers.py) <br>------br> [Rust](./kamyu104/src/sum_of_two_integers.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
6869

6970
kamyu104/src/main.rs
Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,4 +8,5 @@ mod reverse_bits;
88
mod single_number;
99
mod single_number_ii;
1010
mod single_number_iii;
11+
mod sum_of_two_integers;
1112
mod template;

‎kamyu104/src/maximum_product_of_word_lengths.rs

Lines changed: 7 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -14,24 +14,21 @@
1414
// Sorting + Pruning + Bit Manipulation
1515
pub struct Solution2 {}
1616
impl Solution2 {
17-
pub fn max_product(words: Vec<String>) -> i32 {
18-
let mut sorted_words = words.clone();
19-
sorted_words.sort_by(|a, b| b.len().cmp(&a.len()));
17+
pub fn max_product(mut words: Vec<String>) -> i32 {
18+
words.sort_by(|a, b| b.len().cmp(&a.len()));
2019
let mut bits: Vec<i32> = vec![0; words.len()];
21-
for i in 0..sorted_words.len() {
22-
for c in sorted_words[i].chars() {
20+
for i in 0..words.len() {
21+
for c in words[i].chars() {
2322
bits[i] |= 1 << (c as u32 - 'a' as u32);
2423
}
2524
}
2625
let mut max_product: i32 = 0;
2726
let mut i: usize = 0;
28-
while i + 1 < sorted_words.len() && sorted_words[i].len().pow(2) as i32 > max_product {
27+
while i + 1 < words.len() && words[i].len().pow(2) as i32 > max_product {
2928
let mut j: usize = i + 1;
30-
while j < sorted_words.len()
31-
&& (sorted_words[i].len() * sorted_words[j].len()) as i32 > max_product
32-
{
29+
while j < words.len() && (words[i].len() * words[j].len()) as i32 > max_product {
3330
if bits[i] & bits[j] == 0 {
34-
max_product = (sorted_words[i].len() * sorted_words[j].len()) as i32;
31+
max_product = (words[i].len() * words[j].len()) as i32;
3532
}
3633
j += 1;
3734
}

‎kamyu104/src/power_of_four.rs

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -11,12 +11,11 @@ impl Solution1 {
1111
// Space: O(1)
1212
pub struct Solution2 {}
1313
impl Solution2 {
14-
pub fn is_power_of_four(num: i32) -> bool {
15-
let mut n = num;
16-
while n != 0 && (n & 0b11) == 0 {
17-
n >>= 2;
14+
pub fn is_power_of_four(mut num: i32) -> bool {
15+
while num != 0 && (num & 0b11) == 0 {
16+
num >>= 2;
1817
}
19-
n == 1
18+
num == 1
2019
}
2120
}
2221

‎kamyu104/src/sum_of_two_integers.rs

Lines changed: 71 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,71 @@
1+
// Time: O(1)
2+
// Space: O(1)
3+
4+
pub struct Solution1 {}
5+
impl Solution1 {
6+
pub fn get_sum(mut a: i32, mut b: i32) -> i32 {
7+
while b != 0 {
8+
let carry = a & b;
9+
a ^= b;
10+
b = carry << 1;
11+
}
12+
a
13+
}
14+
}
15+
16+
// pub struct Solution2 {}
17+
// impl Solution2 {
18+
// pub fn get_sum(a: i32, b: i32) -> i32 {
19+
// let bit_length = 32;
20+
// let neg_bit = (1 << bit_length) >> 1;
21+
// let mask = !(!0 << bit_length);
22+
23+
// let mut ma = a & mask;
24+
// if a & neg_bit != 0 {
25+
// ma = a | !mask;
26+
// }
27+
28+
// let mut mb = b & mask;
29+
// if b & neg_bit != 0 {
30+
// mb = b | !mask;
31+
// }
32+
33+
// while mb != 0 {
34+
// let carry = ma & mb;
35+
// ma ^= mb;
36+
// if ma & neg_bit != 0 {
37+
// ma = ma | !mask;
38+
// } else {
39+
// ma = ma & mask;
40+
// }
41+
// mb = carry << 1;
42+
// if mb & neg_bit != 0 {
43+
// mb = mb | !mask;
44+
// } else {
45+
// mb = mb & mask;
46+
// }
47+
// }
48+
// a
49+
// }
50+
// }
51+
52+
// pub struct Solution3 {}
53+
// impl Solution3 {}
54+
55+
#[cfg(test)]
56+
mod tests {
57+
// Note this useful idiom: importing names from outer (for mod tests) scope.
58+
use super::*;
59+
60+
#[test]
61+
fn test_get_sum() {
62+
assert_eq!(Solution1::get_sum(1, 2), 3);
63+
assert_eq!(Solution1::get_sum(-2, 3), 1);
64+
65+
// assert_eq!(Solution2::get_sum(1, 2), 3);
66+
// assert_eq!(Solution2::get_sum(-2, 3), 1);
67+
68+
// assert_eq!(Solution3::get_sum(1, 2), 3);
69+
// assert_eq!(Solution3::get_sum(-2, 3), 1);
70+
}
71+
}

0 commit comments

Comments
 (0)