Masalalar
Go Algoritm masala

Uchta son yig‘indisi

07 August, 2026
Go
package main
import (
	"sort" 
)

func (_ Solution) ThreeNumberSum(array []int, target int) [][]int {
  
   sort.Ints(array)
  result := make([][]int, 0)
  
  for index1, item1 := range array {
    for index2 := index1 + 1; index2 < len(array); index2++ {
          item2 := array[index2]

        for index3 := index2 + 1; index3 < len(array); index3++ {
          item3 := array[index3]

          if item1 + item2 + item3 == target {
           result = append(result, []int{item1, item2, item3})
          } 
        }
    }
  }
  if len(result) != 0 {
    return  result
  } 
  return [][]int{}
}

Buyerda 3 t for ishlatildi, 3 ta sondan tashkil topgan kombinatsiyani topish kerak va sort qilib qaytarish kerak boladi.


Go ning sort methodidan foydalangan xolda