From f93bc4d46b2d3e99a8fd8ae87f3ab268fa09b30d Mon Sep 17 00:00:00 2001 From: lionxu Date: Thu, 13 Jun 2019 16:11:19 +0800 Subject: [PATCH 01/11] merge --- problems/0001_Two_Sum/ass.cpp | 0 problems/0001_Two_Sum/jacklynd.c | 0 problems/0002_Add_Two_Numbers/add_two.py | 0 problems/0002_Add_Two_Numbers/ass.cpp | 0 .../jacklynd.cpp | 0 .../0004_Median_of_Two_Sorted_Arrays/jacklynd.cpp | 0 problems/0007_Reverse_Integer/jacklynd.c | 0 problems/0008_String_to_Integer_atoi/jacklynd.c | 0 problems/0013_Roman_to_Integer/jacklynd.c | 0 problems/0014_Longest_Common_Prefix/jacklynd.c | 0 problems/0015_3Sum/jacklynd.c | 0 problems/0016_3Sum_Closest/jacklynd.c | 0 .../0019_Remove_Nth_Node_From_End_of_List/ass.c | 0 problems/0021_Merge_Two_Sorted_Lists/ass.c | 0 problems/0100_Same_Tree/ass.c | 0 .../{0120_triangle => 0120_Triangle}/dev_bin_28.go | 0 .../0203_Remove_Linked_List_Elements/jacklynd.c | 0 problems/0257_binary_tree_paths/fengdongdong.cpp | 0 .../0378.py | 14 -------------- .../0515_Find_Largest_Value_in_Each_Tree_Row/ass.c | 0 problems/0566_Reshape_the_Matrix/016_klgentle.py | 0 problems/0566_Reshape_the_Matrix/jacklynd.c | 0 .../fengdongdong.cpp | 0 .../0876_middleNode.cpp | 0 .../fengdongsheng.cpp | 0 problems/0997_Find_the_Town_Judge/ass.c | 0 26 files changed, 14 deletions(-) mode change 100755 => 100644 problems/0001_Two_Sum/ass.cpp mode change 100755 => 100644 problems/0001_Two_Sum/jacklynd.c mode change 100755 => 100644 problems/0002_Add_Two_Numbers/add_two.py mode change 100755 => 100644 problems/0002_Add_Two_Numbers/ass.cpp mode change 100755 => 100644 problems/0003_Longest_Substring_Without_Repeating_Characters/jacklynd.cpp mode change 100755 => 100644 problems/0004_Median_of_Two_Sorted_Arrays/jacklynd.cpp mode change 100755 => 100644 problems/0007_Reverse_Integer/jacklynd.c mode change 100755 => 100644 problems/0008_String_to_Integer_atoi/jacklynd.c mode change 100755 => 100644 problems/0013_Roman_to_Integer/jacklynd.c mode change 100755 => 100644 problems/0014_Longest_Common_Prefix/jacklynd.c mode change 100755 => 100644 problems/0015_3Sum/jacklynd.c mode change 100755 => 100644 problems/0016_3Sum_Closest/jacklynd.c mode change 100755 => 100644 problems/0019_Remove_Nth_Node_From_End_of_List/ass.c mode change 100755 => 100644 problems/0021_Merge_Two_Sorted_Lists/ass.c mode change 100755 => 100644 problems/0100_Same_Tree/ass.c rename problems/{0120_triangle => 0120_Triangle}/dev_bin_28.go (100%) mode change 100755 => 100644 problems/0203_Remove_Linked_List_Elements/jacklynd.c mode change 100755 => 100644 problems/0257_binary_tree_paths/fengdongdong.cpp delete mode 100644 problems/0378_Kth_Smallest_Element_in_a_Sorted_Matrix /0378.py mode change 100755 => 100644 problems/0515_Find_Largest_Value_in_Each_Tree_Row/ass.c mode change 100755 => 100644 problems/0566_Reshape_the_Matrix/016_klgentle.py mode change 100755 => 100644 problems/0566_Reshape_the_Matrix/jacklynd.c mode change 100755 => 100644 problems/0637_Average_of_Levels_in_Binary_tree/fengdongdong.cpp rename problems/{0876_middle_of_the_linked_list => 0876_Middle_of_the_Linked_List}/0876_middleNode.cpp (100%) mode change 100755 => 100644 problems/0876_Middle_of_the_Linked_List/fengdongsheng.cpp mode change 100755 => 100644 problems/0997_Find_the_Town_Judge/ass.c diff --git a/problems/0001_Two_Sum/ass.cpp b/problems/0001_Two_Sum/ass.cpp old mode 100755 new mode 100644 diff --git a/problems/0001_Two_Sum/jacklynd.c b/problems/0001_Two_Sum/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0002_Add_Two_Numbers/add_two.py b/problems/0002_Add_Two_Numbers/add_two.py old mode 100755 new mode 100644 diff --git a/problems/0002_Add_Two_Numbers/ass.cpp b/problems/0002_Add_Two_Numbers/ass.cpp old mode 100755 new mode 100644 diff --git a/problems/0003_Longest_Substring_Without_Repeating_Characters/jacklynd.cpp b/problems/0003_Longest_Substring_Without_Repeating_Characters/jacklynd.cpp old mode 100755 new mode 100644 diff --git a/problems/0004_Median_of_Two_Sorted_Arrays/jacklynd.cpp b/problems/0004_Median_of_Two_Sorted_Arrays/jacklynd.cpp old mode 100755 new mode 100644 diff --git a/problems/0007_Reverse_Integer/jacklynd.c b/problems/0007_Reverse_Integer/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0008_String_to_Integer_atoi/jacklynd.c b/problems/0008_String_to_Integer_atoi/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0013_Roman_to_Integer/jacklynd.c b/problems/0013_Roman_to_Integer/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0014_Longest_Common_Prefix/jacklynd.c b/problems/0014_Longest_Common_Prefix/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0015_3Sum/jacklynd.c b/problems/0015_3Sum/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0016_3Sum_Closest/jacklynd.c b/problems/0016_3Sum_Closest/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0019_Remove_Nth_Node_From_End_of_List/ass.c b/problems/0019_Remove_Nth_Node_From_End_of_List/ass.c old mode 100755 new mode 100644 diff --git a/problems/0021_Merge_Two_Sorted_Lists/ass.c b/problems/0021_Merge_Two_Sorted_Lists/ass.c old mode 100755 new mode 100644 diff --git a/problems/0100_Same_Tree/ass.c b/problems/0100_Same_Tree/ass.c old mode 100755 new mode 100644 diff --git a/problems/0120_triangle/dev_bin_28.go b/problems/0120_Triangle/dev_bin_28.go similarity index 100% rename from problems/0120_triangle/dev_bin_28.go rename to problems/0120_Triangle/dev_bin_28.go diff --git a/problems/0203_Remove_Linked_List_Elements/jacklynd.c b/problems/0203_Remove_Linked_List_Elements/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0257_binary_tree_paths/fengdongdong.cpp b/problems/0257_binary_tree_paths/fengdongdong.cpp old mode 100755 new mode 100644 diff --git a/problems/0378_Kth_Smallest_Element_in_a_Sorted_Matrix /0378.py b/problems/0378_Kth_Smallest_Element_in_a_Sorted_Matrix /0378.py deleted file mode 100644 index ab49738f..00000000 --- a/problems/0378_Kth_Smallest_Element_in_a_Sorted_Matrix /0378.py +++ /dev/null @@ -1,14 +0,0 @@ -class Solution(object): - def kthSmallest(self, matrix, k): - """ - :type matrix: List[List[int]] - :type k: int - :rtype: int - """ - r_list = [] - for i in range(len(matrix)): - for j in range(len(matrix)): - r_list.append(matrix[i][j]) - r_list.sort() - - return r_list[k - 1] \ No newline at end of file diff --git a/problems/0515_Find_Largest_Value_in_Each_Tree_Row/ass.c b/problems/0515_Find_Largest_Value_in_Each_Tree_Row/ass.c old mode 100755 new mode 100644 diff --git a/problems/0566_Reshape_the_Matrix/016_klgentle.py b/problems/0566_Reshape_the_Matrix/016_klgentle.py old mode 100755 new mode 100644 diff --git a/problems/0566_Reshape_the_Matrix/jacklynd.c b/problems/0566_Reshape_the_Matrix/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0637_Average_of_Levels_in_Binary_tree/fengdongdong.cpp b/problems/0637_Average_of_Levels_in_Binary_tree/fengdongdong.cpp old mode 100755 new mode 100644 diff --git a/problems/0876_middle_of_the_linked_list/0876_middleNode.cpp b/problems/0876_Middle_of_the_Linked_List/0876_middleNode.cpp similarity index 100% rename from problems/0876_middle_of_the_linked_list/0876_middleNode.cpp rename to problems/0876_Middle_of_the_Linked_List/0876_middleNode.cpp diff --git a/problems/0876_Middle_of_the_Linked_List/fengdongsheng.cpp b/problems/0876_Middle_of_the_Linked_List/fengdongsheng.cpp old mode 100755 new mode 100644 diff --git a/problems/0997_Find_the_Town_Judge/ass.c b/problems/0997_Find_the_Town_Judge/ass.c old mode 100755 new mode 100644 From 1656c2a3348ceda2fb88bede686c77677b2af09a Mon Sep 17 00:00:00 2001 From: lionxu Date: Thu, 13 Jun 2019 16:27:56 +0800 Subject: [PATCH 02/11] =?UTF-8?q?[0091=E5=92=8C0303]?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0091_Decode_Ways/solution.py | 28 +++++++++++++++++++++++ problems/0303_Range_Sum_Query/solution.py | 8 +++++++ 2 files changed, 36 insertions(+) create mode 100644 problems/0091_Decode_Ways/solution.py create mode 100644 problems/0303_Range_Sum_Query/solution.py diff --git a/problems/0091_Decode_Ways/solution.py b/problems/0091_Decode_Ways/solution.py new file mode 100644 index 00000000..61f6bf68 --- /dev/null +++ b/problems/0091_Decode_Ways/solution.py @@ -0,0 +1,28 @@ +# 利用动态规划的思想来解决 +# 当前的字符串和前一个字符串组合之后的数值如果在解码的范围内 +# 就可以把当前的字符串和上一次的独立字符串进行合并 +# 合并的结果加上上一个字符串解码的结果就是当前字符串解码的结果 +# 如果是0，就需要特殊处理，0如果和前一个字符串组合后在解码范围内 +# 新产生的解码串就全部是合并的，没有独立的字符串 +# 如果不能和前一个字符串合并的话，那就是无法解码的字符串，直接返回0 +class Solution: + def numDecodings(self, s: str) -> int: + if not s or s[0] == '0': + return 0 + t1 = t2 = 1 + for i in range(1, len(s)): + su = int(s[i-1] + s[i]) + if su >=1 and su <= 26: + if s[i] != '0': + t3 = t2 + t2 += t1 + t1 = t3 + else: + t2 = t1 + t1 = 0 + else: + if s[i] != '0': + t1 = t2 + else: + return 0 + return t2 diff --git a/problems/0303_Range_Sum_Query/solution.py b/problems/0303_Range_Sum_Query/solution.py new file mode 100644 index 00000000..a58e97ee --- /dev/null +++ b/problems/0303_Range_Sum_Query/solution.py @@ -0,0 +1,8 @@ +# 实现比较简单，主要利用python的切片操作 +class NumArray: + + def __init__(self, nums: List[int]): + self.nums = nums + + def sumRange(self, i: int, j: int) -> int: + return sum(self.nums[i:j+1]) From d7521872969da7b8335bf4d7b7ad41c99d0d0df2 Mon Sep 17 00:00:00 2001 From: lionxu Date: Thu, 13 Jun 2019 16:29:25 +0800 Subject: [PATCH 03/11] [add commit id] --- submittors/2_lionfly.txt | 1 + 1 file changed, 1 insertion(+) diff --git a/submittors/2_lionfly.txt b/submittors/2_lionfly.txt index efe7f5c5..77ac7f35 100644 --- a/submittors/2_lionfly.txt +++ b/submittors/2_lionfly.txt @@ -1,2 +1,3 @@ fd0ecff1fb6e30105632bfdc007d83efdc86acf1 173cc1fd589331069b57c75f641312a68d024841 + 1656c2a3348ceda2fb88bede686c77677b2af09a From 18ec884c3891a2818ff26a23214e103c114dbeac Mon Sep 17 00:00:00 2001 From: lionxu Date: Fri, 14 Jun 2019 12:36:26 +0800 Subject: [PATCH 04/11] [0053] --- problems/0053_Maximum_Subarray/solution.py | 46 ++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 problems/0053_Maximum_Subarray/solution.py diff --git a/problems/0053_Maximum_Subarray/solution.py b/problems/0053_Maximum_Subarray/solution.py new file mode 100644 index 00000000..e5e27ad4 --- /dev/null +++ b/problems/0053_Maximum_Subarray/solution.py @@ -0,0 +1,46 @@ +# 本题有两种解法，分别是动态规划和分而治之 +# 动态规划，主要是定义一个dp数组，用来保存到index为止,数组的子序列的和 +# dp[0]等于数组的第一个元素的值，从数组第一个元素开始，其下标为i,如果dp[i-1] > 0,那么dp[i]=dp[i-1] + nums[i], 如果dp[i-1] < 0,那么dp[i]=nums[i] +# 在计算dp数组的时候，记录每次子序列和的最大值，该最大值就是所求子序列和的最大值 +class solution: + def maxSubArray(self, nums): + if not nums: + return 0 + dp = len(nums) * [0] + sub_max = dp[0] = nums[0] + + for i in range(1, len(nums)): + if dp[i-1] > 0: + dp[i] = dp[i-1] + nums[i] + else: + dp[i] = nums[i] + sub_max = max(dp[i], sub_max) + return sub_max + +# 分而治之的方式，主要是利用二分的方式，把数组一分为二，首先求出左边子数组的最大和，然后再求出右边子数组的最大和，然后从中间元素开始， +# 进行遍历求出当前子序列的最大和 +class Solution: + def maxSubArray(self, nums): + def find_max(nums, left, right): + if left >= right: + return nums[left] + + center = (left + right) // 2 + lmax = find_max(nums, left, center - 1) + rmax = find_max(nums, center + 1, right) + t = mmax = nums[center] + + for i in range(center - 1, left - 1, -1): + t += nums[i] + mmax = max(t, mmax) + t = mmax + + for i in range(center + 1, right, 1): + t += nums[i] + mmax = max(t, mmax) + return max(mmax, lmax, rmax) + + if not nums: + return 0 + else: + return find_max(nums, 0, len(nums) - 1) From 1864f6f445db016e2c28db69dc5eff2e6cca5c83 Mon Sep 17 00:00:00 2001 From: lionxu Date: Fri, 14 Jun 2019 12:37:14 +0800 Subject: [PATCH 05/11] add commit id --- submittors/2_lionfly.txt | 1 + 1 file changed, 1 insertion(+) diff --git a/submittors/2_lionfly.txt b/submittors/2_lionfly.txt index 77ac7f35..bcbba197 100644 --- a/submittors/2_lionfly.txt +++ b/submittors/2_lionfly.txt @@ -1,3 +1,4 @@ fd0ecff1fb6e30105632bfdc007d83efdc86acf1 173cc1fd589331069b57c75f641312a68d024841 1656c2a3348ceda2fb88bede686c77677b2af09a + 18ec884c3891a2818ff26a23214e103c114dbeac From 85cc6a69fd079a2603fc3f9f74a0acf47fcfa877 Mon Sep 17 00:00:00 2001 From: lionxu Date: Wed, 19 Jun 2019 21:22:02 +0800 Subject: [PATCH 06/11] update --- problems/0001_Two_Sum/ass.cpp | 0 problems/0001_Two_Sum/jacklynd.c | 0 problems/0002_Add_Two_Numbers/add_two.py | 0 problems/0002_Add_Two_Numbers/ass.cpp | 0 .../jacklynd.cpp | 0 .../0004_Median_of_Two_Sorted_Arrays/jacklynd.cpp | 0 problems/0007_Reverse_Integer/jacklynd.c | 0 problems/0008_String_to_Integer_atoi/jacklynd.c | 0 problems/0013_Roman_to_Integer/jacklynd.c | 0 problems/0014_Longest_Common_Prefix/jacklynd.c | 0 problems/0015_3Sum/jacklynd.c | 0 problems/0016_3Sum_Closest/jacklynd.c | 0 .../0019_Remove_Nth_Node_From_End_of_List/ass.c | 0 problems/0021_Merge_Two_Sorted_Lists/ass.c | 0 problems/0100_Same_Tree/ass.c | 0 .../{0120_triangle => 0120_Triangle}/dev_bin_28.go | 0 .../0203_Remove_Linked_List_Elements/jacklynd.c | 0 problems/0257_binary_tree_paths/fengdongdong.cpp | 0 .../0378.py | 14 -------------- .../0515_Find_Largest_Value_in_Each_Tree_Row/ass.c | 0 problems/0566_Reshape_the_Matrix/016_klgentle.py | 0 problems/0566_Reshape_the_Matrix/jacklynd.c | 0 .../fengdongdong.cpp | 0 .../0876_middleNode.cpp | 0 .../fengdongsheng.cpp | 0 problems/0997_Find_the_Town_Judge/ass.c | 0 26 files changed, 14 deletions(-) mode change 100755 => 100644 problems/0001_Two_Sum/ass.cpp mode change 100755 => 100644 problems/0001_Two_Sum/jacklynd.c mode change 100755 => 100644 problems/0002_Add_Two_Numbers/add_two.py mode change 100755 => 100644 problems/0002_Add_Two_Numbers/ass.cpp mode change 100755 => 100644 problems/0003_Longest_Substring_Without_Repeating_Characters/jacklynd.cpp mode change 100755 => 100644 problems/0004_Median_of_Two_Sorted_Arrays/jacklynd.cpp mode change 100755 => 100644 problems/0007_Reverse_Integer/jacklynd.c mode change 100755 => 100644 problems/0008_String_to_Integer_atoi/jacklynd.c mode change 100755 => 100644 problems/0013_Roman_to_Integer/jacklynd.c mode change 100755 => 100644 problems/0014_Longest_Common_Prefix/jacklynd.c mode change 100755 => 100644 problems/0015_3Sum/jacklynd.c mode change 100755 => 100644 problems/0016_3Sum_Closest/jacklynd.c mode change 100755 => 100644 problems/0019_Remove_Nth_Node_From_End_of_List/ass.c mode change 100755 => 100644 problems/0021_Merge_Two_Sorted_Lists/ass.c mode change 100755 => 100644 problems/0100_Same_Tree/ass.c rename problems/{0120_triangle => 0120_Triangle}/dev_bin_28.go (100%) mode change 100755 => 100644 problems/0203_Remove_Linked_List_Elements/jacklynd.c mode change 100755 => 100644 problems/0257_binary_tree_paths/fengdongdong.cpp delete mode 100644 problems/0378_Kth_Smallest_Element_in_a_Sorted_Matrix /0378.py mode change 100755 => 100644 problems/0515_Find_Largest_Value_in_Each_Tree_Row/ass.c mode change 100755 => 100644 problems/0566_Reshape_the_Matrix/016_klgentle.py mode change 100755 => 100644 problems/0566_Reshape_the_Matrix/jacklynd.c mode change 100755 => 100644 problems/0637_Average_of_Levels_in_Binary_tree/fengdongdong.cpp rename problems/{0876_middle_of_the_linked_list => 0876_Middle_of_the_Linked_List}/0876_middleNode.cpp (100%) mode change 100755 => 100644 problems/0876_Middle_of_the_Linked_List/fengdongsheng.cpp mode change 100755 => 100644 problems/0997_Find_the_Town_Judge/ass.c diff --git a/problems/0001_Two_Sum/ass.cpp b/problems/0001_Two_Sum/ass.cpp old mode 100755 new mode 100644 diff --git a/problems/0001_Two_Sum/jacklynd.c b/problems/0001_Two_Sum/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0002_Add_Two_Numbers/add_two.py b/problems/0002_Add_Two_Numbers/add_two.py old mode 100755 new mode 100644 diff --git a/problems/0002_Add_Two_Numbers/ass.cpp b/problems/0002_Add_Two_Numbers/ass.cpp old mode 100755 new mode 100644 diff --git a/problems/0003_Longest_Substring_Without_Repeating_Characters/jacklynd.cpp b/problems/0003_Longest_Substring_Without_Repeating_Characters/jacklynd.cpp old mode 100755 new mode 100644 diff --git a/problems/0004_Median_of_Two_Sorted_Arrays/jacklynd.cpp b/problems/0004_Median_of_Two_Sorted_Arrays/jacklynd.cpp old mode 100755 new mode 100644 diff --git a/problems/0007_Reverse_Integer/jacklynd.c b/problems/0007_Reverse_Integer/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0008_String_to_Integer_atoi/jacklynd.c b/problems/0008_String_to_Integer_atoi/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0013_Roman_to_Integer/jacklynd.c b/problems/0013_Roman_to_Integer/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0014_Longest_Common_Prefix/jacklynd.c b/problems/0014_Longest_Common_Prefix/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0015_3Sum/jacklynd.c b/problems/0015_3Sum/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0016_3Sum_Closest/jacklynd.c b/problems/0016_3Sum_Closest/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0019_Remove_Nth_Node_From_End_of_List/ass.c b/problems/0019_Remove_Nth_Node_From_End_of_List/ass.c old mode 100755 new mode 100644 diff --git a/problems/0021_Merge_Two_Sorted_Lists/ass.c b/problems/0021_Merge_Two_Sorted_Lists/ass.c old mode 100755 new mode 100644 diff --git a/problems/0100_Same_Tree/ass.c b/problems/0100_Same_Tree/ass.c old mode 100755 new mode 100644 diff --git a/problems/0120_triangle/dev_bin_28.go b/problems/0120_Triangle/dev_bin_28.go similarity index 100% rename from problems/0120_triangle/dev_bin_28.go rename to problems/0120_Triangle/dev_bin_28.go diff --git a/problems/0203_Remove_Linked_List_Elements/jacklynd.c b/problems/0203_Remove_Linked_List_Elements/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0257_binary_tree_paths/fengdongdong.cpp b/problems/0257_binary_tree_paths/fengdongdong.cpp old mode 100755 new mode 100644 diff --git a/problems/0378_Kth_Smallest_Element_in_a_Sorted_Matrix /0378.py b/problems/0378_Kth_Smallest_Element_in_a_Sorted_Matrix /0378.py deleted file mode 100644 index ab49738f..00000000 --- a/problems/0378_Kth_Smallest_Element_in_a_Sorted_Matrix /0378.py +++ /dev/null @@ -1,14 +0,0 @@ -class Solution(object): - def kthSmallest(self, matrix, k): - """ - :type matrix: List[List[int]] - :type k: int - :rtype: int - """ - r_list = [] - for i in range(len(matrix)): - for j in range(len(matrix)): - r_list.append(matrix[i][j]) - r_list.sort() - - return r_list[k - 1] \ No newline at end of file diff --git a/problems/0515_Find_Largest_Value_in_Each_Tree_Row/ass.c b/problems/0515_Find_Largest_Value_in_Each_Tree_Row/ass.c old mode 100755 new mode 100644 diff --git a/problems/0566_Reshape_the_Matrix/016_klgentle.py b/problems/0566_Reshape_the_Matrix/016_klgentle.py old mode 100755 new mode 100644 diff --git a/problems/0566_Reshape_the_Matrix/jacklynd.c b/problems/0566_Reshape_the_Matrix/jacklynd.c old mode 100755 new mode 100644 diff --git a/problems/0637_Average_of_Levels_in_Binary_tree/fengdongdong.cpp b/problems/0637_Average_of_Levels_in_Binary_tree/fengdongdong.cpp old mode 100755 new mode 100644 diff --git a/problems/0876_middle_of_the_linked_list/0876_middleNode.cpp b/problems/0876_Middle_of_the_Linked_List/0876_middleNode.cpp similarity index 100% rename from problems/0876_middle_of_the_linked_list/0876_middleNode.cpp rename to problems/0876_Middle_of_the_Linked_List/0876_middleNode.cpp diff --git a/problems/0876_Middle_of_the_Linked_List/fengdongsheng.cpp b/problems/0876_Middle_of_the_Linked_List/fengdongsheng.cpp old mode 100755 new mode 100644 diff --git a/problems/0997_Find_the_Town_Judge/ass.c b/problems/0997_Find_the_Town_Judge/ass.c old mode 100755 new mode 100644 From d3891e08919d7454c21c43651b7dc1e2403c4cab Mon Sep 17 00:00:00 2001 From: lionxu Date: Thu, 20 Jun 2019 21:50:01 +0800 Subject: [PATCH 07/11] [0058] --- problems/0058_Length_of_Last_Word/solution.py | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 problems/0058_Length_of_Last_Word/solution.py diff --git a/problems/0058_Length_of_Last_Word/solution.py b/problems/0058_Length_of_Last_Word/solution.py new file mode 100644 index 00000000..16f40476 --- /dev/null +++ b/problems/0058_Length_of_Last_Word/solution.py @@ -0,0 +1,11 @@ +# 此题难度角度，主要就是依据空格对字符串进行分词 +# 在此过程中，需要注意的是需要把字符串默认的空格去掉 +class Solution: + def lengthOfLastWord(self, s): + cnt, tail = 0, len(s) - 1 + while tail >= 0 and s[tail] == ' ': + tail -= 1 + while tail >= 0 and s[tail] != ' ': + cnt += 1 + tail -= 1 + return cnt From 1147ef650f633005761e00e575d3a5928689af1b Mon Sep 17 00:00:00 2001 From: lionxu Date: Thu, 20 Jun 2019 21:50:45 +0800 Subject: [PATCH 08/11] commit ID --- submittors/2_lionfly.txt | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/submittors/2_lionfly.txt b/submittors/2_lionfly.txt index bcbba197..496a16dc 100644 --- a/submittors/2_lionfly.txt +++ b/submittors/2_lionfly.txt @@ -1,4 +1,5 @@ fd0ecff1fb6e30105632bfdc007d83efdc86acf1 173cc1fd589331069b57c75f641312a68d024841 1656c2a3348ceda2fb88bede686c77677b2af09a - 18ec884c3891a2818ff26a23214e103c114dbeac + 18ec884c3891a2818ff26a23214e103c114dbeac + d3891e08919d7454c21c43651b7dc1e2403c4cab From 43dfc0ca99e4cb0a7ac437cc740e4a6e5d1bca19 Mon Sep 17 00:00:00 2001 From: lionxu Date: Tue, 25 Jun 2019 20:14:57 +0800 Subject: [PATCH 09/11] [0002_Add_Two_Numbers] --- problems/0002_Add_Two_Numbers/solution.py | 28 +++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 problems/0002_Add_Two_Numbers/solution.py diff --git a/problems/0002_Add_Two_Numbers/solution.py b/problems/0002_Add_Two_Numbers/solution.py new file mode 100644 index 00000000..f267f016 --- /dev/null +++ b/problems/0002_Add_Two_Numbers/solution.py @@ -0,0 +1,28 @@ +# 这道题目主要是,使用链表来表示大数 +# 通过遍历两个链表,将对应的位上的数字相加 +# 相加的时候,要注意进位的问题 +# 同时,应该注意两个链表长度不同的问题 +# 最后,还应该检查最后两个数字相加后,是否有进位的问题 + + +class ListNode(object): + def __init__(self, x): + self.val = x + self.next = None + + +class Solution(object): + def addTwoNumbers(self, l1, l2): + root = ListNode(0) + node = root + res = 0 + while l1 or l2: + x = l1.val if l1 else 0 + y = l2.val if l2 else 0 + s = res + x + y + node.next = ListNode(s % 10) + res = s // 10 + if l1 is not None: l1 = l1.next + if l2 is not None: l2 = l2.next + if res > 0: node.next = ListNode(1) + return root.next From 71904a009ac1c9cb31535d56e69cf54c1457b545 Mon Sep 17 00:00:00 2001 From: lionxu Date: Tue, 25 Jun 2019 20:15:34 +0800 Subject: [PATCH 10/11] commit Id --- submittors/2_lionfly.txt | 1 + 1 file changed, 1 insertion(+) diff --git a/submittors/2_lionfly.txt b/submittors/2_lionfly.txt index 496a16dc..55fe11d6 100644 --- a/submittors/2_lionfly.txt +++ b/submittors/2_lionfly.txt @@ -3,3 +3,4 @@ 1656c2a3348ceda2fb88bede686c77677b2af09a 18ec884c3891a2818ff26a23214e103c114dbeac d3891e08919d7454c21c43651b7dc1e2403c4cab + 43dfc0ca99e4cb0a7ac437cc740e4a6e5d1bca19 From 83c8dce65b68084321c6653fceac6e848893ccca Mon Sep 17 00:00:00 2001 From: lionxu Date: Tue, 2 Jul 2019 22:21:50 +0800 Subject: [PATCH 11/11] 0006-Z-conversion --- problems/0006_ZigZag_Conversion/Solution.py | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 problems/0006_ZigZag_Conversion/Solution.py diff --git a/problems/0006_ZigZag_Conversion/Solution.py b/problems/0006_ZigZag_Conversion/Solution.py new file mode 100644 index 00000000..b6bc8055 --- /dev/null +++ b/problems/0006_ZigZag_Conversion/Solution.py @@ -0,0 +1,18 @@ +class Solution: + def convert(self, s, numRows): + if numRows == 1: return s + result = [[] for i in range(numRowns)] + row = 0 + direct = 1 + for c in s: + result[row].append(c) + if row >= numRows - 1: + direct = -1 + elif row == 0: + direct = 1 + row += direct + answer = '' + for row in result: + for col in row: + answer += col + return answer