mogutou1214

/*
 * test.cpp
 *Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?
 *  Created on: 2013-5-4
 *      Author: Fred
 */

#include <iostream>
#include <string>

mogutou1214

/*
 * test.cpp
Given two strings, write a method to decide if one is a permutation of the other.
 *  Created on: 2013-5-5
 *      Author: Fred
 */

#include <iostream>
#include <string>
using namespace std;

mogutou1214

#include <iostream>
#include <string>
#include <sstream>
using namespace std;

string conv2str(int num){
  ostringstream ostr; //output string stream
	ostr << num; //use the string stream just like cout,
	return ostr.str();
}

mogutou1214

#include "stdafx.h"
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;


bool ifanagram(string str1,string str2){
  if(str1.length()!=str2.length()) return false;
	sort(str1.begin(),str1.end());

mogutou1214

/*Remove duplicates from an unsorted linked list - cc2.1*/
void removeDuplicate1(node *head){
  map<int,bool> table;
	node *curr = head;
	node *pre = NULL;
	while(curr!=NULL){
		/*delete the node if it already exists in the map*/
		if(table[curr->data]){
			pre->next = curr->next;
			delete curr;

mogutou1214

void delGivenNode(node *entry){
  entry->data = (entry->next)->data;
	entry->next = (entry->next)->next;
	delete entry->next;
}

mogutou1214

bool isPalindrome(node *head){
  if(head==NULL) return false;
	node *curr = head;
	stack<int> s;
	while(curr!=NULL){
		s.push(curr->data);
		curr = curr->next;
	}

	/*while(!s.empty()){

mogutou1214

#include <iostream>
#include <stack>

using namespace std;

class MyException{
 public:
  MyException(){cout << "the stack is empty" << endl;}
};

mogutou1214

// Linkedlist.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
using namespace std;


struct node{
  int data;

mogutou1214

// Linkedlist.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
using namespace std;

template <class T>
struct node{
  T data;