Movatterモバイル変換

Skip to content

warmchang/leetcode-c-cplusplusPublic

forked frombegeekmyfriend/leetcode

NotificationsYou must be signed in to change notification settings
Fork0
Star0

Commitc40b4b8

begeekmyfriend

committed

Improvement

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

1 parent72226ca commitc40b4b8Copy full SHA for c40b4b8

File tree

3 files changed

+31

-28

lines changed

0058_length_of_last_word
- word_length.c
0070_climbing_stairs
- climb_stairs.c
0083_remove_duplicates_from_sorted_list
- rm_dup.c

3 files changed

+31

-28

lines changed

`‎0058_length_of_last_word/word_length.c‎`

Lines changed: 11 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,18 +1,20 @@`
`1`	`1`	`#include<stdio.h>`
`2`	`2`	`#include<stdlib.h>`
	`3`	`+#include<string.h>`
`3`	`4`
`4`	`5`	`intlengthOfLastWord(char*s)`
`5`	`6`	`{`
`6`		`-intlen=0;`
`7`		`-while (*s!='\0') {`
`8`		`-if (s[-1]==' '&&s[0]!=' ') {`
`9`		`-len=1;`
`10`		`- }elseif (*s!=' ') {`
`11`		`-len++;`
`12`		`-}`
`13`		`-s++;`
	`7`	`+intword_len=0;`
	`8`	`+intlen=strlen(s);`
	`9`	`+`
	`10`	`+while (len>0&&s[--len]==' ') {}`
	`11`	`+`
	`12`	`+while (len >=0&&s[len]!=' ') {`
	`13`	`+word_len++;`
	`14`	`+len--;`
`14`	`15`	`}`
`15`		`-returnlen;`
	`16`	`+`
	`17`	`+returnword_len;`
`16`	`18`	`}`
`17`	`19`
`18`	`20`	`intmain(intargc,char**argv)`

`‎0070_climbing_stairs/climb_stairs.c‎`

Lines changed: 8 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -4,28 +4,25 @@`
`4`	`4`
`5`	`5`	`staticintdfs(intn,int*count)`
`6`	`6`	`{`
`7`		`-if (n==0) {`
`8`		`-return0;`
	`7`	`+if (n==1) {`
	`8`	`+return1;`
	`9`	`+ }elseif (n==2) {`
	`10`	`+return2;`
`9`	`11`	`}elseif (count[n]>0) {`
`10`	`12`	`returncount[n];`
`11`	`13`	`}else {`
`12`		`-if (n >=1) {`
`13`		`-count[n]+=dfs(n-1,count);`
`14`		`- }`
`15`		`-if (n >=2) {`
`16`		`-count[n]+=dfs(n-2,count);`
`17`		`- }`
	`14`	`+count[n]+=dfs(n-1,count);`
	`15`	`+count[n]+=dfs(n-2,count);`
`18`	`16`	`returncount[n];`
`19`	`17`	`}`
`20`	`18`	`}`
`21`	`19`
`22`	`20`	`staticintclimbStairs(intn)`
`23`	`21`	`{`
`24`		`-#if0`
	`22`	`+#if1`
	`23`	`+if (n<1)return0;`
`25`	`24`	`intcount=malloc((n+1)sizeof(int));`
`26`	`25`	`memset(count,0, (n+1)*sizeof(int));`
`27`		`-count[1]=1;`
`28`		`-count[2]=2;`
`29`	`26`	`returndfs(n,count);`
`30`	`27`	`#else`
`31`	`28`	`inti,a=1,b=2,c;`

`‎0083_remove_duplicates_from_sorted_list/rm_dup.c‎`

Lines changed: 12 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+#include<limits.h>`
`1`	`2`	`#include<stdio.h>`
`2`	`3`	`#include<stdlib.h>`
`3`	`4`
`@@ -9,16 +10,19 @@ struct ListNode {`
`9`	`10`
`10`	`11`	`structListNodedeleteDuplicates(structListNodehead)`
`11`	`12`	`{`
`12`		`-structListNodep,q;`
`13`		`-p=q=head;`
`14`		`-while (p!=NULL) {`
`15`		`-while (q!=NULL&&q->val==p->val) {`
`16`		`-q=q->next;`
	`13`	`+structListNodedummy;`
	`14`	`+structListNode*prev=&dummy;`
	`15`	`+dummy.val=INT_MIN;`
	`16`	`+`
	`17`	`+while (head!=NULL) {`
	`18`	`+if (prev->val!=head->val) {`
	`19`	`+prev->next=head;`
	`20`	`+prev=head;`
`17`	`21`	`}`
`18`		`-p->next=q;`
`19`		`-p=q;`
	`22`	`+head=head->next;`
`20`	`23`	`}`
`21`		`-returnhead;`
	`24`	`+prev->next=head;`
	`25`	`+returndummy.next;`
`22`	`26`	`}`
`23`	`27`
`24`	`28`	`intmain(intargc,char**argv)`

0 commit comments

Comments

(0)

[8]ページ先頭

©2009-2025 Movatter.jp