yuijam

const fs = require('fs')
const path = require('path')

function getBirthTime(dir) {
  let stat = fs.statSync(dir)
  return stat.birthtimeMs
}

function isValid(filename) {
  return filename.startsWith('T')
}

const filesPath = path.join(__dirname, '/mm')
fs.readdir(filesPath, (err, files) => {
  if (!err){
    files.sort((x, y) => {
      let xp = path.join(filesPath, x)
      let yp = path.join(filesPath, y)
      return getBirthTime(yp) - getBirthTime(xp)
    })
    console.log(files)
    let curValidFile
    let curValidName
    let cnt = 1
    files.forEach(f => {
      console.log(f)
      if (isValid(f)){
        curValidName = f
        curValidFile = path.join(filesPath, f)
        cnt = 1
      }else {
        let newname = `${curValidName.slice(0, -4)}--r--${cnt++}.pdf`
        let newpath = path.join(filesPath, newname)
        fs.renameSync(path.join(filesPath, f), newpath)
      }
    })
  }
})

/// 97.08%  68.03%
var isValid = function(s) {
	let stack = [];
	for(i of s){
		if (i === '(' || i === '{' || i === '['){
			stack.push(i)
		}else{
			if (stack.length > 0){
				let top = stack.pop()
				if (!top) return false
				if ((top === '(' && i === ')') || (top === '[' && i === ']') || (top === '{' && i === '}')){
					
				}else{
					return false
				}
			}else{
				return false
			}
		}
	}
	return stack.length === 0
};

// 30.43% 好像是5% orz
/**
 * @param {number} k
 * @param {number[]} nums
 */
var KthLargest = function(k, nums) {
    this.sortedNums = nums.sort((a, b) => b - a);
	this.kmax = this.sortedNums[k-1]
    this.k = k
};

/** 
 * @param {number} val
 * @return {number}
 */
KthLargest.prototype.add = function(val) {
	if (!this.kmax) {
		this.sortedNums.push(val)
		this.sortedNums.sort((a, b) => b - a)
		this.kmax = this.sortedNums[this.k-1];
		return this.kmax
	}
	if (val <= this.kmax) return this.kmax
	let tmp = [], flag = true
	let i = 0, j = 0;
	// console.log(this.k, this.sortedNums[j])
	while (i < this.k){
		if (val > this.sortedNums[j] && flag){
			tmp[i++] = val
			flag = false
		}else{
			tmp[i++] = this.sortedNums[j++]
		}
	}
	this.sortedNums = tmp
	this.kmax = this.sortedNums[this.k-1]
	return this.kmax
};

/** 
 * Your KthLargest object will be instantiated and called as such:
 * var obj = new KthLargest(k, nums)
 * var param_1 = obj.add(val)
 */