Python SymPy Permutation.ascents()用法及代码示例

排列.ascents()：ascents()是一个sympy Python库函数，它返回排列中上升的位置。
上升是a [i]的要素

用法： sympy.combinatorics.permutations.Permutation.ascents()

返回：排列中上升的位置

代码1：ascents()示例

# Python code explaining 
# SymPy.ascents() 
  
# importing SymPy libraries 
from sympy.combinatorics.partitions import Partition 
from sympy.combinatorics.permutations import Permutation 
  
# Using from sympy.combinatorics.permutations.Permutation.ascents() method  
  
# creating Permutation 
a = Permutation([[2, 0], [3, 1]]) 
  
b = Permutation([1, 3, 5, 4, 2, 0]) 
  
  
print ("Permutation a - ascents form : ", a.ascents()) 
print ("Permutation b - ascents form : ", b.ascents())

输出：

Permutation a – ascents form : [0, 2]
Permutation b – ascents form : [0, 1]

代码2：ascents()示例– 2D排列

# Python code explaining 
# SymPy.ascents() 
  
# importing SymPy libraries 
from sympy.combinatorics.partitions import Partition 
from sympy.combinatorics.permutations import Permutation 
  
# Using from sympy.combinatorics.permutations.Permutation.ascents() method  
  
# creating Permutation 
a = Permutation([[2, 4, 0],  
                 [3, 1, 2], 
                 [1, 5, 6]]) 
  
  
print ("Permutation a - ascents form : ", a.ascents())

输出：

Permutation a – ascents form : [1, 2, 4]

相关用法

注：本文由纯净天空筛选整理自noobestars101大神的英文原创作品 Python | SymPy Permutation.ascents() method。非经特殊声明，原始代码版权归原作者所有，本译文未经允许或授权，请勿转载或复制。