solved q911

refactor some files to avoid duplication of method names

Author: ruislan

src/q/mod.rs

@@ -415,6 +415,7 @@ mod q896;
 mod q897;
 mod q905;
 mod q908;
+mod q911;
 mod q914;
 mod q917;
 mod q921;

src/q/q137.rs

@@ -2,7 +2,7 @@ use crate::q::Solution;
 
 #[allow(unused)]
 impl Solution {
-    pub fn single_number(nums: Vec<i32>) -> i32 {
+    pub fn single_number_2(nums: Vec<i32>) -> i32 {
         // 方法1
         // hashmap
         // O(n), O(n)

src/q/q1449.rs

@@ -2,7 +2,7 @@ use crate::q::Solution;
 
 #[allow(unused)]
 impl Solution {
-    pub fn largest_number(cost: Vec<i32>, target: i32) -> String {
+    pub fn largest_number_2(cost: Vec<i32>, target: i32) -> String {
         // 方法1
         // 还是个动态规划的典型题目
         // 这里我们核心要考虑的是两个数字比较，谁大？

src/q/q229.rs

@@ -2,7 +2,7 @@ use crate::q::Solution;
 
 #[allow(unused)]
 impl Solution {
-    pub fn majority_element(nums: Vec<i32>) -> Vec<i32> {
+    pub fn majority_element_2(nums: Vec<i32>) -> Vec<i32> {
         // 方法1
         // 计数，O(n)空间，不是最佳
         // AC 0ms 2.3mb

src/q/q236.rs

@@ -25,14 +25,14 @@ impl TreeNode {
 
 #[allow(unused)]
 impl Solution {
-    pub fn lowest_common_ancestor(root: Option<Rc<RefCell<TreeNode>>>, p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
+    pub fn lowest_common_ancestor_2(root: Option<Rc<RefCell<TreeNode>>>, p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
         // 方法1
         if root.is_none() { return None; }
         if root == p || root == q { return root; }
         let left = root.as_ref().unwrap().borrow().left.clone();
         let right = root.as_ref().unwrap().borrow().right.clone();
-        let left_parent = Self::lowest_common_ancestor(left, p.clone(), q.clone());
-        let right_parent = Self::lowest_common_ancestor(right, p.clone(), q.clone());
+        let left_parent = Self::lowest_common_ancestor_2(left, p.clone(), q.clone());
+        let right_parent = Self::lowest_common_ancestor_2(right, p.clone(), q.clone());
         if left_parent.is_none() { return right_parent; }
         if right_parent.is_none() { return left_parent; }
         root

src/q/q260.rs

@@ -2,7 +2,7 @@ use crate::q::Solution;
 
 #[allow(unused)]
 impl Solution {
-    pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
+    pub fn single_number_3(nums: Vec<i32>) -> Vec<i32> {
         // 方法1
         // hashset
         // AC 0ms 2.2mb 32/32

src/q/q275.rs

@@ -2,7 +2,7 @@ use crate::q::Solution;
 
 #[allow(unused)]
 impl Solution {
-    pub fn h_index(citations: Vec<i32>) -> i32 {
+    pub fn h_index_2(citations: Vec<i32>) -> i32 {
         // 方法1
         // 和q274基本相同，这里用二分方法来处理
         // AC 0ms 2.7mb

src/q/q437.rs

@@ -24,7 +24,7 @@ impl TreeNode {
 
 #[allow(unused)]
 impl Solution {
-    pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> i32 {
+    pub fn path_sum_2(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> i32 {
         // 方法1
         // dfs
         // 每次向下我们都将结果增加1位，然后遍历，如果结果正好等于target，就叠加计数

src/q/q552.rs

@@ -2,7 +2,7 @@ use crate::q::Solution;
 
 #[allow(unused)]
 impl Solution {
-    pub fn check_record(n: i32) -> i32 {
+    pub fn check_record_2(n: i32) -> i32 {
         // 方法1
         // 回溯 + 记忆化
         // AC 340ms 29.3mb 用hashmap会超时：(

src/q/q556.rs

@@ -2,7 +2,7 @@ use crate::q::Solution;
 
 #[allow(unused)]
 impl Solution {
-    pub fn next_greater_element(n: i32) -> i32 {
+    pub fn next_greater_element_2(n: i32) -> i32 {
         // 方法1
         // 这个算法还挺有名的哈，就叫next permutation
         // 简单来说