feat: add solutions to lc problem: No.1227 (doocs#3600)

No.1227.Airplane Seat Assignment Probability

Author: yanglbme

solution/1200-1299/1227.Airplane Seat Assignment Probability/README.md

@@ -142,6 +142,8 @@ f(n) = \begin{cases}
 \end{cases}
 $$
 
+时间复杂度 $O(1)$，空间复杂度 $O(1)$。
+
 <!-- tabs:start -->
 
 #### Python3
@@ -184,6 +186,24 @@ func nthPersonGetsNthSeat(n int) float64 {
 }
 ```
 
+#### TypeScript
+
+```ts
+function nthPersonGetsNthSeat(n: number): number {
+    return n === 1 ? 1 : 0.5;
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+    pub fn nth_person_gets_nth_seat(n: i32) -> f64 {
+        return if n == 1 { 1.0 } else { 0.5 };
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1200-1299/1227.Airplane Seat Assignment Probability/README_EN.md

@@ -136,6 +136,8 @@ f(n) = \begin{cases}
 \end{cases}
 $$
 
+The time complexity of this solution is $O(1)$, and the space complexity is $O(1)$.
+
 <!-- tabs:start -->
 
 #### Python3
@@ -178,6 +180,24 @@ func nthPersonGetsNthSeat(n int) float64 {
 }
 ```
 
+#### TypeScript
+
+```ts
+function nthPersonGetsNthSeat(n: number): number {
+    return n === 1 ? 1 : 0.5;
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+    pub fn nth_person_gets_nth_seat(n: i32) -> f64 {
+        return if n == 1 { 1.0 } else { 0.5 };
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1200-1299/1227.Airplane Seat Assignment Probability/Solution.rs

@@ -0,0 +1,5 @@
+impl Solution {
+    pub fn nth_person_gets_nth_seat(n: i32) -> f64 {
+        return if n == 1 { 1.0 } else { 0.5 };
+    }
+}

solution/1200-1299/1227.Airplane Seat Assignment Probability/Solution.ts

@@ -0,0 +1,3 @@
+function nthPersonGetsNthSeat(n: number): number {
+    return n === 1 ? 1 : 0.5;
+}