from pandas import Series
import math
pstf_list=[]
def psfeatureTime(data,p1,p2):
 #均值
 df_mean=data[p1:p2].mean()
 #方差
 df_var=data[p1:p2].var()
 #標(biāo)準(zhǔn)差
 df_std=data[p1:p2].std()
 #均方根
 df_rms=math.sqrt(pow(df_mean,2) + pow(df_std,2))
 #偏度
 df_skew=data[p1:p2].skew()
 #峭度
 df_kurt=data[p1:p2].kurt()
 sum=0
 for i in range(p1,p2):
  sum+=math.sqrt(abs(data[i]))
 #波形因子
 df_boxing=df_rms / (abs(data[p1:p2]).mean())
 #峰值因子
 df_fengzhi=(max(data[p1:p2])) / df_rms
 #脈沖因子
 df_maichong=(max(data[p1:p2])) / (abs(data[p1:p2]).mean())
 #裕度因子
 df_yudu=(max(data[p1:p2])) / pow((sum/(p2-p1)),2)
 featuretime_list = [df_mean,df_rms,df_skew,df_kurt,df_boxing,df_fengzhi,df_maichong,df_yudu]
 return featuretime_list 

class Solution:
 def letterCombination(self,digits):
  
  phone={'2': ['a', 'b', 'c'],
     '3': ['d', 'e', 'f'],
     '4': ['g', 'h', 'i'],
     
     '5': ['j', 'k', 'l'],
     '6': ['m', 'n', 'o'],
     '7': ['p', 'q', 'r', 's'],
     '8': ['t', 'u', 'v'],
     '9': ['w', 'x', 'y', 'z']}
  
  res=[]#存放組合結(jié)果
  def backtrack(combination,next_digits):#回溯函數(shù)
   #combination目前已經(jīng)產(chǎn)生的組合，next_digits:輸入的下一個(gè)字符
   if len(next_digits)==0: #遞歸出口
    res.append(combination)
   else:
    for i in phone[next_digits[0]]:
     backtrack(combination+i,next_digits[1:]) #遞歸實(shí)現(xiàn)回溯
  if digits:
   backtrack('',digits) #初始化
  return res

class Solution:
 def permute(self,nums):
  
  res=[] #存放組合結(jié)果
  size=len(nums)
  
  def backtrack(combination,nums):
   #combination目前已經(jīng)產(chǎn)生的組合，nums為剩下的數(shù)組
   #遞歸出口
   #遞歸的結(jié)束一定 要有return
   if len(combination)==size:
    res.append(combination) 
    return #注意
   for i in range(len(nums)):
     backtrack(combination+[nums[i]],nums[:i]+nums[i+1:]) #遞歸回溯
  
  backtrack([],nums)
  return res
    
if __name__=='__main__':
 nums = [1,2,3]
 solution=Solution()
 print(solution.permute(nums)) 

class Solution:
 def combinationArray(self,candidates,target):
  
  candidates.sort()
  res=[] #存放組合結(jié)果
  size=len(candidates)
  
  def backtrack(combination,cur_sum,j):
   #combination目前已經(jīng)產(chǎn)生的組合,cur_sum當(dāng)前計(jì)算和，j用于控制求和的查找范圍起點(diǎn)
   #遞歸出口
   if cur_sum>target:
    return 
   if cur_sum==target:
    res.append(combination)
   for i in range(j,size): #j避免重復(fù)
    if cur_sum+candidates[i]>target: #約束函數(shù)(剪)
     break
    j=i
    backtrack(combination+[candidates[i]],cur_sum+candidates[i],j)#遞歸回溯
    
  backtrack([],0,0)
  return res
if __name__=='__main__':
 candidates = [2,3,6,7]
 target = 7
 solution=Solution()
 print(solution.combinationArray(candidates,target))

class Solution: 
 def solveNqueen(self,n):
  
  res=[] #存放結(jié)果組合，對(duì)于N皇后問(wèn)題，這里存放的是其放在每一行對(duì)應(yīng)的列下標(biāo)  
  def backtrack(combination):
    if len(combination)==n:
     res.append(combination)
     return
    for j in range(n):
     if combination:
      #排除當(dāng)前行，列和對(duì)應(yīng)的兩個(gè)對(duì)角線。
      if j not in combination and j!=combination[-1]+1 and j!=combination[-1]-1:#約束條件
       backtrack(combination+[j]) #遞歸回溯
      else:
       continue 
     else:
     backtrack(combination+[j])     
             
  backtrack([]) #回溯初始化
  
  #轉(zhuǎn)化為需要的格式
  output=[["." * k + "Q" + "." * (n - k - 1) for k in i] for i in res] #列表生成器
  return output
  
if __name__=='__main__':
 n=4
 solution=Solution()
 print(solution.solveNqueen(n)) 

class Solution(object):
 def subsets(self, nums):
  """
  :type nums: List[int]
  :rtype: List[List[int]]
  """
  res=[]#存放組合結(jié)果
  size=len(nums)
  
  def backtrack(combination,nums):
   #combination目前已經(jīng)產(chǎn)生的組合，nums為剩下的數(shù)組
   if len(combination)<=size:
    res.append(combination)
   #遞歸出口
   #遞歸的結(jié)束一定 要有return
   if len(combination)==size:
    return 
   
   for i in range(len(nums)):
    backtrack(combination+[nums[i]],nums[i+1:]) #遞歸回溯
   
  backtrack([],nums)
  return res
 
if __name__=='__main__':
 nums=[1,2,3]
 solution=Solution()
 print(solution.subsets(nums)) 

class Solution:
 def letterpermute(self,S):
  
  res=[]
  size=len(S)
  
  def backtrack(combination,S):
   
   if len(combination)==size:
    res.append(''.join(combination))
    return 
   
   for i in range(len(S)):
    if "a"<=S[i]<= "z" or "A"<=S[i]<= "Z":
     for j in range(2):
      if j==0:
       backtrack(combination+[S[i].lower()],S[i+1:])
      if j==1:
       backtrack(combination+[S[i].upper()],S[i+1:])
      
    else:
     backtrack(combination+[S[i]],S[i+1:])
     
     
  backtrack([],S)
  return res   
 
if __name__=='__main__':
 S=[i for i in "1B2"]
 solution=Solution()
 print(solution.letterpermute(S)) 

class Solution:
 def generateParenthesis(self,n):
  
  res=[] #存放組合結(jié)果
  def backtrack(combination,left,right):
   #combination目前已經(jīng)產(chǎn)生的組合
   if len(combination)==2*n: #遞歸出口
    res.append(combination)
   #對(duì)于有效的括號(hào)，左邊先出
   if left<n:
    backtrack(combination+'(',left+1,right)#遞歸實(shí)現(xiàn)回溯
   if right<left:
    backtrack(combination+')',left,right+1)#遞歸實(shí)現(xiàn)回溯
     
  backtrack('',0,0) #初始化
  return res 
if __name__=='__main__':
 n=3
 solution=Solution()
 print(solution.generateParenthesis(n))