zoukankan      html  css  js  c++  java
  • Scala

    Unit01

    scala> val arr = Array[Int](1,2,3,4,5)
    arr: Array[Int] = Array(1, 2, 3, 4, 5)
    
    scala> for (i<-arr){}
    
    scala> for (i<-arr){println(i)}
    1
    2
    3
    4
    5
    
    角标来取值
    scala> arr(2)
    res2: Int = 3
    
    scala> var idx = Array(0,1,2,3,4)
    idx: Array[Int] = Array(0, 1, 2, 3, 4)
    
    scala> for(i<-idx){println(arr(i))}
    
    
    scala> 1 to 10
    res4: scala.collection.immutable.Range.Inclusive = Range(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
    
    scala> 1.to(10)
    res5: scala.collection.immutable.Range.Inclusive = Range(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
    
    
    scala> 0 until 5
    res7: scala.collection.immutable.Range = Range(0, 1, 2, 3, 4)
    
    
    scala> for(ele <- 0 to 5) println(arr(ele))
    1
    2
    3
    4
    5
    java.lang.ArrayIndexOutOfBoundsException: 5
      at $anonfun$1.apply$mcVI$sp(<console>:13)
      at scala.collection.immutable.Range.foreach$mVc$sp(Range.scala:160)
      ... 32 elided
    
    
    scala> for (ele <- 0 until arr.length) println(arr(ele))
    1
    2
    3
    4
    5
    
    scala> arr
    res9: Array[Int] = Array(1, 2, 3, 4, 5)
    
    scala> for (ele <- arr){
         | if (ele%2==0) println(ele)
         | }
    2
    4
    
    scala> for (ele <- arr;if ele%2==0) println(ele)
    2
    4
    
    scala> for (ele <- arr if ele%2==0) println(ele)
    2
    4
    
    双层for循环
    scala> for(i <- 1 to 3;j <- 1 to 3 if i != j) println(10*i+j)
    12
    13
    21
    23
    31
    32
    
    scala> for(i <- 1 to 3;j <- 1 to 3 if i != j) yield(10*i+j)
    res15: scala.collection.immutable.IndexedSeq[Int] = Vector(12, 13, 21, 23, 31, 32)
    
    运算符重载
    操作符重载成方法
    scala> 1.+(2)
    res16: Int = 3
    
    
        
    

      

  • 相关阅读:
    history对象
    排序算法总结
    Boltzmann机
    Sort Colors
    First Missing Positive
    Sort List
    Insertion Sort List
    Merge Two Sorted Lists
    Merge Sorted Array
    Sum Root to Leaf Numbers
  • 原文地址:https://www.cnblogs.com/cerofang/p/10529194.html
Copyright © 2011-2022 走看看