LeetCode 242

Valid Anagram

Given two strings s and t, write a function to determine if t is an anagram of s.

For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return false.

Note:
You may assume the string contains only lowercase alphabets.

Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?

/*************************************************************************
    > File Name: LeetCode242.c
    > Author: Juntaran    
    > Mail: Jacinthmail@gmail.com
    > Created Time: 2016年05月10日 星期二 03时49分39秒
 ************************************************************************/

/*************************************************************************
    
    Valid Anagram
    
    Given two strings s and t, write a function to determine if t is an anagram of s.

    For example,
    s = "anagram", t = "nagaram", return true.
    s = "rat", t = "car", return false.

    Note:
    You may assume the string contains only lowercase alphabets.

    Follow up:
    What if the inputs contain unicode characters? How would you adapt your solution to such case?

 ************************************************************************/

#include "stdio.h"

int isAnagram(char* s, char* t)
{
    int ret;

    if (strlen(s) != strlen(t))
    {
        ret = 0;
    }


    int i;
    int flag[26] = {0};

    for ( i=0; i<strlen(s); i++ )
    {
        flag[s[i] - 'a']++;
        printf("%d ",s[i] - 'a');
        printf("%d
",flag[s[i] - 'a']);

        flag[t[i] - 'a']--;
        printf("%d ",t[i] - 'a');
        printf("%d
",flag[t[i] - 'a']);
    }
    
    for( i=0; i<26; i++ )
    {
        if( flag[i] != 0 )
        {
            ret = 0;
        }
        printf("%d ",flag[i]);
    }
    ret = 1;
    printf("
%d
",ret);
    
    return ret;
}

int main()
{
    char* s = "nl";
    char* t = "cx";
    
    int result = isAnagram(s,t);
    
    return 0;
}