Commit c9ba025

committed

Refine

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent b9dc8ac commit c9ba025Copy full SHA for c9ba025

File tree

+14

-12

lines changed

+14

-12

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,8 +25,8 @@ static double mySqrt(double x)`
`25`	`25`
`26`	`26`	`static double mySqrt(double n)`
`27`	`27`	`{`
`28`		`- /* Solute the zero point of f(x) = 0 => x ^ 2 - n = 0 */`
`29`		`- /* f(x) = (x - x0)f'(x0) - f(x0) = 0 First order of Tylor series */`
	`28`	`+ /* Solute the zero point of f(x). Let F(x) = f(x) - n = 0 */`
	`29`	`+ /* then (x - x0)F'(x0) + F(x0) = 0 which is the first order of Tylor series */`
`30`	`30`	`double x = 1.0;`
`31`	`31`	`while (fabs(x * x - n) > 1e-8) {`
`32`	`32`	`// x = x - (x * x - n) / (2 * x);`

Lines changed: 4 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,21 +1,20 @@`
`1`	`1`	`#include <stdio.h>`
`2`	`2`	`#include <stdlib.h>`
`3`	`3`
	`4`	`+`
`4`	`5`	`static void merge(int* nums1, int m, int* nums2, int n)`
`5`	`6`	`{`
`6`	`7`	`int i = m - 1, j = n - 1, k = nums1Size - 1;`
`7`		`- while (i >= 0 && j >= 0&&k >= 0) {`
	`8`	`+ while (i >= 0 && j >= 0) {`
`8`	`9`	`if (nums1[i] >= nums2[j]) {`
`9`	`10`	`nums1[k--] = nums1[i--];`
`10`	`11`	`} else {`
`11`	`12`	`nums1[k--] = nums2[j--];`
`12`	`13`	`}`
`13`	`14`	`}`
`14`	`15`
`15`		`- if (i == -1) {`
`16`		`- while (j >= 0) {`
`17`		`- nums1[k--] = nums2[j--];`
`18`		`- }`
	`16`	`+ while (j >= 0) {`
	`17`	`+ nums1[k--] = nums2[j--];`
`19`	`18`	`}`
`20`	`19`	`}`
`21`	`20`

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,19 +10,19 @@ struct TreeNode {`
`10`	`10`
`11`	`11`	`static struct TreeNode partition(int nums, int lo, int hi)`
`12`	`12`	`{`
	`13`	`+ if (lo > hi) {`
	`14`	`+ return NULL;`
	`15`	`+ }`
`13`	`16`	`int mid = lo + (hi - lo) / 2;`
`14`	`17`	`struct TreeNode node = malloc(sizeof(node));`
`15`	`18`	`node->val = nums[mid];`
`16`		`- node->left = mid>lo ? partition(nums, lo, mid - 1) : NULL;`
`17`		`- node->right = mid<hi ? partition(nums, mid + 1, hi) : NULL;`
	`19`	`+ node->left = partition(nums, lo, mid - 1);`
	`20`	`+ node->right = partition(nums, mid + 1, hi);`
`18`	`21`	`return node;`
`19`	`22`	`}`
`20`	`23`
`21`	`24`	`static struct TreeNode* sortedArrayToBST(int* nums, int numsSize)`
`22`	`25`	`{`
`23`		`- if (numsSize == 0) {`
`24`		`- return NULL;`
`25`		`- }`
`26`	`26`	`return partition(nums, 0, numsSize - 1);`
`27`	`27`	`}`
`28`	`28`

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@`
`2`	`2`	`#include <stdlib.h>`
`3`	`3`	`#include <stdbool.h>`
`4`	`4`
	`5`	`+`
`5`	`6`	`struct TreeNode {`
`6`	`7`	`int val;`
`7`	`8`	`struct TreeNode *left;`
`@@ -11,8 +12,10 @@ struct TreeNode {`
`11`	`12`	`static bool hasPathSum(struct TreeNode *root, int sum)`
`12`	`13`	`{`
`13`	`14`	`if (root == NULL) {`
	`15`	`+ /* Here is non leaf */`
`14`	`16`	`return false;`
`15`	`17`	`} else if (root->left == NULL && root->right == NULL && root->val == sum) {`
	`18`	`+ /* Here must be leaf */`
`16`	`19`	`return true;`
`17`	`20`	`} else {`
`18`	`21`	`return hasPathSum(root->left, sum - root->val) \|\| hasPathSum(root->right, sum - root->val);`

Comments

(0)