var arr = [{
    "name": "ZYTX",
    "age": "Y13xG_4wQnOWK1QwJLgg11d0pS4hewePU95UHtpMl3eE81uS74NC-6zu-Rtnw4Ix",
    "gender": "AAAAAA.doc"
}, {
    "name": "ZYTA",
    "age": "Y13xG_4wQnOWK1QwJLgg11d0pS4hewePU95UHtpMl3eE81uS74NC-6zu-Rtnw4Ix",
    "gender": "BBBBBB.doc"
}, {
    "name": "ZDTX",
    "age": "Y13xG_4wQnOWK1QwJLgg11d0pS4hewePU95UHtpMl3eE81uS74NC-6zu-Rtnw4Ix",
    "gender": "CCCCCC.doc"
}, {
    "name": "ZYTX",
    "age": "Y13xG_4wQnOWK1QwJLgg11d0pS4hewePU95UHtpMl3eE81uS74NC-6zu-Rtnw4Ix",
    "gender": "AAAAAA.doc"
}];
var hash = {};
arr = arr.reduce(function(item, next) {
    hash[next.name] ? '' : hash[next.name] = true && item.push(next);
    return item
}, [])
console.log(arr);

如果支持ES6标准的话，直接使用Set对象进行去重就好了

var rs = new Set(arr);

毕竟集合是不包含重复元素的

var set = arr.reduce(
  function(set, item) {
    set[item["name"]] = item;
    return set;
  },
  {}
);

Object.keys(set).map(function(key) { return set[key]; });

参考 lodash:uniqBy

如果考虑效率的话，
function unique(arr) {

var result = [], hash = {};
for (var i = 0, f_code; (f_code = arr[0]) != null; i++) {
    if (!hash[f_code]) {
        result.push(f_code);
        hash[f_code] = true;
    }
}
return result;

}
http://blog.csdn.net/zhihua_w...推荐楼主去看看这篇文章