JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding leetcode problem

Browse Source
This commit is contained in:
Jidong Xiao
2023-09-11 22:44:52 -04:00
parent 9de5f2280f
commit 5e08c8444f
2 changed files with 80 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

79
leetcode/p26_removeduplicates.cpp Normal file
View File

@@ -0,0 +1,79 @@
class Solution {
public:
/* // just use vectors
int removeDuplicates(vector<int>& nums) {
int size = nums.size();
if(size == 0){
return 0;
}
if(size == 1){
return 1;
}
// nums has at least 2 elements
int j = 1;
for(int i=0;i<size-1;i++){
if(nums[i+1]!=nums[i]){
// meaning nums[i+1] is a new number, we should store it in nums[j]
nums[j] = nums[i+1];
j++;
}
}
return j;
}*/
/* // use C arrays
int removeDuplicates(vector<int>& nums) {
int size = nums.size();
int array[size];
for(int i=0;i<size;i++){
array[i] = nums[i];
}
if(size == 0){
return 0;
}
if(size == 1){
return 1;
}
// nums has at least 2 elements
int j = 1;
for(int i=0;i<size-1;i++){
if(array[i+1]!=array[i]){
// meaning nums[i+1] is a new number, we should store it in nums[j]
array[j] = array[i+1];
j++;
}
}
for(int i=0;i<j;i++){
nums[i] = array[i];
}
return j;
}*/
// use c arrays with pointer arithmetic
int removeDuplicates(vector<int>& nums) {
int size = nums.size();
int array[size];
for(int i=0;i<size;i++){
*(array+i) = nums[i];
}
if(size == 0){
return 0;
}
if(size == 1){
return 1;
}
// nums has at least 2 elements
int j = 1;
for(int i=0;i<size-1;i++){
if(*(array+i+1)!=*(array+i)){
// meaning nums[i+1] is a new number, we should store it in nums[j]
*(array+j) = *(array+i+1);
j++;
}
}
for(int i=0;i<j;i++){
nums[i] = *(array+i);
}
return j;
}
};