Commit c698627

authored

feat: add C solution to lcof2 problem: No.012 (doocs#2195)

1 parent 16b4ce4 commit c698627Copy full SHA for c698627

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -198,6 +198,29 @@ class Solution {`
`198`	`198`	`}`
`199`	`199`	```
`200`	`200`
	`201`	`+### C`
	`202`	`+`
	`203`	+```c
	`204`	`+int pivotIndex(int* nums, int numsSize) {`
	`205`	`+ int left, right;`
	`206`	`+ left = 0;`
	`207`	`+ right = 0;`
	`208`	`+`
	`209`	`+ for (int i = 0; i < numsSize; i++) {`
	`210`	`+ right += nums[i];`
	`211`	`+ }`
	`212`	`+`
	`213`	`+ for (int i = 0; i < numsSize; i++) {`
	`214`	`+ right -= nums[i];`
	`215`	`+ if (right == left)`
	`216`	`+ return i;`
	`217`	`+ left += nums[i];`
	`218`	`+ }`
	`219`	`+`
	`220`	`+ return -1;`
	`221`	`+}`
	`222`	+```
	`223`	`+`
`201`	`224`	`### ...`
`202`	`225`
`203`	`226`	```

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+int pivotIndex(int* nums, int numsSize) {`
	`2`	`+ int left, right;`
	`3`	`+ left = 0;`
	`4`	`+ right = 0;`
	`5`	`+`
	`6`	`+ for (int i = 0; i < numsSize; i++) {`
	`7`	`+ right += nums[i];`
	`8`	`+ }`
	`9`	`+`
	`10`	`+ for (int i = 0; i < numsSize; i++) {`
	`11`	`+ right -= nums[i];`
	`12`	`+ if (right == left)`
	`13`	`+ return i;`
	`14`	`+ left += nums[i];`
	`15`	`+ }`
	`16`	`+`
	`17`	`+ return -1;`
	`18`	`+}`

Comments

(0)