Commit e78db76

authored

Add 1486(C++) - Xor-operation-in-an-array (#172)

* Add xor-operation-in-an-array c++ * Add readme * Fix readme * Fix xor-operation-in-an-array

1 parent 68163cc commit e78db76Copy full SHA for e78db76

File tree

+13

-1

lines changed

+13

-1

lines changed

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+// difficulty easy`
	`2`	`+class Solution {`
	`3`	`+public:`
	`4`	`+ int xorOperation(int n, int start) {`
	`5`	`+ // brute force method`
	`6`	`+ int ans = 0;`
	`7`	`+ for(int i=0;i<n;i++){`
	`8`	`+ ans ^= (start + 2*i);`
	`9`	`+ }`
	`10`	`+ return ans;`
	`11`	`+ }`
	`12`	`+};`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -88,7 +88,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu`
`88`	`88`	`\| 371 \| [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) \| [Java](./Java/Sum_of_two_integers.java) \| _O(1)_ \| _O(1)_ \| Medium \|`
`89`	`89`	`\| 476 \| [Number Complement](https://leetcode.com/problems/number-complement/) \| [Java](./Java/number-complement.java) <br/> [C++](./C++/Number-Complement.cpp) \| _O(1)_ \| _O(1)_ \| Easy \| \| [Tutorial](https://youtu.be/6bp5V-O3zts) \|`
`90`	`90`	`\| 520 \| [Detect Capital Use](https://leetcode.com/problems/detect-capital/) \| [Python](./Python/detect-capital.py) <br/> [C++](./C++/Detect-Capital.cpp) \| _O(n)_ \| _O(1)_ \| Easy \| \| \|`
`91`		`-\| 1486 \| [XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/) \| [Java](./Java/xor-op-in-array.java) \| _O(n)_ \| _O(1)_ \| Easy \| \| Using XOR \|`
	`91`	`+\| 1486 \| [XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/) \| [Java](./Java/xor-op-in-array.java) <br/> [C++](./C++/xor-operation-in-an-array.cpp) \| _O(n)_ \| _O(1)_ \| Easy \| \| Using XOR \|`
`92`	`92`
`93`	`93`	`<br/>`
`94`	`94`	`<div align="right">`

Comments

(0)