File tree 1 file changed +30
-2
lines changed
1 file changed +30
-2
lines changed Original file line number Diff line number Diff line change @@ -40,7 +40,7 @@ Your algorithm should have a linear runtime complexity. Could you implement it w
40
40
41
41
## 代码
42
42
43
- * 语言支持:JS,C++ ,Python
43
+ * 语言支持:JS,C,C++,Java ,Python
44
44
45
45
JavaScrip Code:
46
46
``` js
@@ -93,7 +93,20 @@ var singleNumber = function(nums) {
93
93
return ret;
94
94
};
95
95
```
96
- C++:
96
+ C Code:
97
+ ``` C
98
+ int singleNumber (int* nums, int numsSize){
99
+ int res=0;
100
+ for(int i=0;i<numsSize;i++)
101
+ {
102
+ res ^= nums[ i] ;
103
+ }
104
+
105
+ return res;
106
+ }
107
+ ```
108
+
109
+ C++ Code:
97
110
```C++
98
111
class Solution {
99
112
public:
@@ -113,6 +126,21 @@ public:
113
126
};
114
127
```
115
128
129
+ Java Code:
130
+ ``` java
131
+ class Solution {
132
+ public int singleNumber (int [] nums ) {
133
+ int res = 0 ;
134
+ for (int n: nums)
135
+ {
136
+ // 异或
137
+ res ^ = n;
138
+ }
139
+ return res;
140
+ }
141
+ }
142
+ ```
143
+
116
144
Python Code:
117
145
118
146
``` python
You can’t perform that action at this time.
0 commit comments